Elsevier

Discrete Mathematics

Volume 214, Issues 1–3, 21 March 2000, Pages 279-283
Discrete Mathematics

Note
The Komlós–Sós conjecture for graphs of girth 7

https://doi.org/10.1016/S0012-365X(99)00316-7Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)