Embedding trees in graphs with independence number two
From MaRDI portal
Recommendations
Cites work
- An approximate version of the Loebl-Komlós-Sós conjecture
- Constructing Trees in Graphs whose Complement has no K2,s
- Constructing trees in graphs with no K2,s
- scientific article; zbMATH DE number 1792598 (Why is no real title available?)
- scientific article; zbMATH DE number 881162 (Why is no real title available?)
- Loebl-Komlós-Sós conjecture: dense case
- On the Loebl-Koml�s-S�s conjecture
- Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\)
- Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
- The Erdös-Sós conjecture for graphs of girth 5
- The Erdös-Sós conjecture for graphs without \(C_ 4\)
- The Erdős-Sós conjecture for graphs whose complements contain no C₄
- The Erdős-Sós conjecture for spiders
- The Erdős-Sós conjecture for spiders of large size
- The Erdős‐Sós Conjecture for trees of diameter four
- The Komlós conjecture for graphs of girth 7
- The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
- Tree embeddings
This page was built for publication: Embedding trees in graphs with independence number two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577857)