Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-27T22:10:37.409Z Has data issue: false hasContentIssue false
  • English
  • Français

Packing Cliques in Graphs with Independence Number 2

Published online by Cambridge University Press:  01 September 2007

RAPHAEL YUSTER
RAPHAEL YUSTER*
Affiliation:
Department of Mathematics, University of Haifa, Haifa 31905, Israel (e-mail: raphy@research.haifa.ac.il)
Get access Rights & Permissions [Opens in a new window]

Abstract

Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t such that, for any graph with n vertices, m edges, and independence number 2, at least t edges can be packed with edge-disjoint copies of Kk. Turán's theorem together with Wilson's Theorem assert that if . A conjecture of Erdős states that for all plausible m. For any ε > 0, this conjecture was open even if . Generally, f_k(n,m) may be significantly smaller than . Indeed, for k=7 it is easy to show that for m ≈ 0.3n2. Nevertheless, we prove the following result. For every k≥ 3 there exists γ>0 such that if then . In the special case k=3 we obtain the reasonable bound γ ≥ 10−4. In particular, the above conjecture of Erdős holds whenever G has fewer than 0.2501n2 edges.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 16 , Issue 5 , September 2007 , pp. 805 - 817
Copyright
Copyright © Cambridge University Press 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Bollobás, B. (1998) Modern Graph Theory, Springer.CrossRefGoogle Scholar
[2]Erdős, P. (1997) Some recent problems and results in graph theory. Discrete Math. 164 81–85.CrossRefGoogle Scholar
[3]Erdős, P., Faudree, R. J., Gould, R. J., Jacobson, M. S. and Lehel, J. (2001) Edge disjoint monochromatic triangles in 2-colored graphs. Discrete Math. 231 135–141.CrossRefGoogle Scholar
[4]Haxell, P. E. and Rödl, V. (2001) Integer and fractional packings in dense graphs. Combinatorica 21 13–38.CrossRefGoogle Scholar
[5]Keevash, P. and Sudakov, B. (2004) Packing triangles in a graph and its complement. J. Graph Theory 47 203–216.CrossRefGoogle Scholar
[6]Simonovits, M. (1968) A method for solving extremal problems in graph theory, stability problems. In Theory of Graphs (Proc. Colloq. Tihany, 1966), Academic Press, New York, and Akad. Kiadó, Budapest, pp. 279–319.Google Scholar
[7]Wilson, R. M. (1975) Decomposition of complete graphs into subgraphs isomorphic to a given graph. Congressus Numerantium XV 647–659.Google Scholar
[8]Yuster, R.(2005) Asymptotically optimal K k-packings of dense graphs via fractional K k-decompositions. J. Combin. Theory Ser. B 95 1–11.CrossRefGoogle Scholar
[9]Yuster, R. (2005) Integer and fractional packing of families of graphs. Random Struct. Alg. 26 110–118.CrossRefGoogle Scholar