Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs

@article{Cooley2009ProofOT,
  title={Proof of the Loebl-Koml{\'o}s-S{\'o}s conjecture for large, dense graphs},
  author={Oliver Cooley},
  journal={Discrete Mathematics},
  year={2009},
  volume={309},
  pages={6190-6228}
}
The Loebl–Komlós–Sós conjecture states that for any integers k and n, if a graph G on n vertices has at least n/2 vertices of degree at least k, then G contains as subgraphs all trees on k + 1 vertices. We prove this conjecture in the case when k is linear in n, and n is sufficiently large. © 2009 Elsevier B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Graph Theory

  • R. Diestel
  • third edition, Springer-Verlag
  • 2005
1 Excerpt

Thesis , University of Birmingham ( in preparation )

  • Ph. D. O. Cooley
  • 2005

Another Note on the Loebl–Komlós–Sós conjecture

  • O. Barr, R. Johansson
  • Research reports, vol. 22, UmeåUniversity, Sweden
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…