Packing triangles in a graph and its com
✍
Peter Keevash; Benny Sudakov
📂
Article
📅
2004
🏛
John Wiley and Sons
🌐
English
⚖ 127 KB
👁 1 views
## Abstract How few edge‐disjoint triangles can there be in a graph __G__ on __n__ vertices and in its complement $\overline {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__^2^/12 + __o__(__n__