Discrete MathematicsVolume 214, Issues 1–3, 21 March 2000, Pages 279-283NoteThe Komlós–Sós conjecture for graphs of girth 7Author links open overlay panelSara Nadiv SofferShow moreShareCitehttps://doi.org/10.1016/S0012-365X(99)00316-7Get rights and contentUnder an Elsevier user licenseopen archiveAbstractIf a graph has girth at least seven and half its vertices have degree at least k, then it contains all trees of size k.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 2000 Elsevier Science B.V. All rights reserved.