Packing triangles in a graph and its complement

How few edge-disjoint triangles can there be in a graph G on n vertices and in its complement G? This question was posed by P. Erdó́s, who noticed that if G is a disjoint union of two complete graphs of order n=2 then this number is n=12 þ o(n). Erdó́s conjectured that any other graph with n vertices together with its complement should also contain at least that many edge-disjoint triangles. In this paper, we show how to use a fractional relaxation of the above problem to prove that for every graph G of order n, the total number of edge-disjoint triangles contained in G and G is at least n=13 for all sufficiently large n. This bound improves some earlier results. We discuss a few related questions as well. 2004 Wiley Periodicals, Inc. J Graph Theory 47: 203–216, 2004

[1]  Zoltán Füredi,et al.  Matchings and covers in hypergraphs , 1988, Graphs Comb..

[2]  Zoltán Füredi,et al.  On the Fractional Covering Number of Hypergraphs , 1988, SIAM J. Discret. Math..

[3]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[4]  Vojtech Rödl,et al.  Integer and Fractional Packings in Dense Graphs , 2001, Comb..

[5]  Paul Erdös,et al.  Edge disjoint monochromatic triangles in 2-colored graphs , 2001, Discret. Math..

[6]  Ramsey Theory,et al.  Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.

[7]  Joel H. Spencer,et al.  Asymptotic behavior of the chromatic index for hypergraphs , 1989, J. Comb. Theory, Ser. A.

[8]  A. Goodman.  On Sets of Acquaintances and Strangers at any Party , 1959 .

[9]  András Gyárfás,et al.  Fruit Salad , 1997, Electron. J. Comb..

[10]  Paul Erdös,et al.  Some recent problems and results in graph theory , 1997, Discret. Math..

[11]  M. Simonovits,et al.  Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .