The Komlós-Sós conjecture for graphs of girth 7

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

If a graph has girth at least seven and half its vertices have degree at least k, then it contains all trees of size k.

Original languageEnglish (US)
Pages (from-to)279-283
Number of pages5
JournalDiscrete Mathematics
Volume214
Issue number1-3
DOIs
StatePublished - Mar 21 2000

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this