Pages that link to "Item:Q3146982"
From MaRDI portal
The following pages link to Constructing Trees in Graphs whose Complement has no <b><i>K</i></b><sub>2,<b><i>s</i></b></sub> (Q3146982):
Displayed 10 items.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- On Erdős-Sós conjecture for trees of large size (Q276193) (← links)
- On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices (Q389980) (← links)
- A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q895997) (← links)
- Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs (Q1045015) (← links)
- A variation of the Erdős-Sós conjecture in bipartite graphs (Q2014230) (← links)
- Embedding trees in graphs with independence number two (Q4577857) (← links)
- A Local Approach to the Erdös--Sós Conjecture (Q4631099) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)