Embedding trees in graphs with independence number two

DOI10.1142/S1793830918500507zbMath1393.05078OpenAlexW2803157141MaRDI QIDQ4577857

Xiaolan Hu, Yaojun Chen

Publication date: 3 August 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500507

zbMATH Keywords

independence numbertreesLoebl-Komlós-Sós conjectureErdős-Sós conjecture

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Unnamed Item
• Unnamed Item
• The Erdős-Sós conjecture for spiders of large size
• Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
• The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)
• The Erdös-Sós conjecture for graphs of girth 5
• The Komlós conjecture for graphs of girth 7
• The Erdős-Sós conjecture for spiders
• Tree embeddings
• Loebl-Komlós-Sós Conjecture: dense case
• Constructing Trees in Graphs whose Complement has no K_2,s
• [https://portal.mardi4nfdi.de/wiki/Publication:4506067 On the Loebl-Koml�s-S�s conjecture]
• The Erdős‐Sós Conjecture for trees of diameter four
• Constructing trees in graphs with no K_2,s
• An approximate version of the Loebl-Komlós-Sós conjecture