反d-退化图中的点不交3-圈

Vertex-disjoint triangles in anti-d-degenerate graphs

如果图G的补图G是d-退化图,则称图G是反d-退化图。证明了当|G|=3k且δ(G)≥k≥26d时,反d-退化图G包含k个点不交的3-圈,其中d≥2。

A graph G is an anti-d-degenerate graph if its complement graph G is a d-degenerate graph.It is proved that every anti-d-degenerate graph G with|G|=3k andδ(G)≥k≥26d contains k vertex-disjoint triangles,where d≥2.