The following pages link to (Q4871074):
Displayed 17 items.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q895997) (← links)
- An Erdős-Gallai type theorem for vertex colored graphs (Q2000563) (← links)
- Degree conditions for forests in graphs (Q2581630) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Maximum and Minimum Degree Conditions for Embedding Trees (Q5128507) (← links)
- Degree Conditions for Embedding Trees (Q5232383) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs (Q5267993) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result (Q5267995) (← links)
- On the Erdős–Sós conjecture for trees with bounded degree (Q5886108) (← links)
- An approximate version of the Loebl-Komlós-Sós conjecture (Q5895546) (← links)
- An approximate version of the Loebl-Komlós-Sós conjecture (Q5900074) (← links)
- Degree conditions on copies of forests in graphs (Q6093997) (← links)
- Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result (Q6094046) (← links)
- Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result (Q6094048) (← links)
- Dirac-type conditions for spanning bounded-degree hypertrees (Q6187344) (← links)