Title of article
The Komlós–Sós conjecture for graphs of girth 7
Author/Authors
Sara Nadiv Soffer، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
5
From page
279
To page
283
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.
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950361
Link To Document