The Komlós conjecture for graphs of girth 7

DOI10.1016/S0012-365X(99)00316-7zbMath0946.05027OpenAlexW1995016862WikidataQ123357099 ScholiaQ123357099MaRDI QIDQ1972153

Sara Nadiv Soffer

Publication date: 23 October 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00316-7

zbMATH Keywords

girthtreesmedian degree

Mathematics Subject Classification ID

Trees (05C05)

Related Items (7)

Embedding trees in graphs with independence number two ⋮ Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ Loebl-Komlós-Sós conjecture: dense case ⋮ Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs ⋮ On a conjecture about trees in graphs with large girth ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition ⋮ The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs

This page was built for publication: The Komlós conjecture for graphs of girth 7