The following pages link to On the Erd�s-S�s conjecture (Q4865531):
Displaying 36 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 fan-wheel and tree-wheel Ramsey numbers (Q297927) (← links)
- On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices (Q389980) (← links)
- The Erdős-Sós conjecture for spiders of large size (Q393909) (← links)
- A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277) (← links)
- Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\) (Q625393) (← links)
- Long paths with endpoints in given vertex-subsets of graphs (Q941396) (← links)
- A variation of a conjecture due to Erdös and Sós (Q1034303) (← links)
- Subtrees and subforests of graphs (Q1328385) (← links)
- On graphs which contain each tree of given size (Q1356784) (← links)
- The Erdös-Sós conjecture for graphs without \(C_ 4\) (Q1362105) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
- Local and mean Ramsey numbers for trees (Q1850471) (← links)
- On a conjecture about trees in graphs with large girth (Q1850563) (← links)
- The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\) (Q1884650) (← links)
- The Erdös-Sós conjecture for graphs of girth 5 (Q1916132) (← links)
- A variation of the Erdős-Sós conjecture in bipartite graphs (Q2014230) (← links)
- On the Erdős-Sós conjecture for graphs with circumference at most \(k+1\) (Q2089550) (← links)
- An Erdős-Gallai-type theorem for keyrings (Q2413630) (← links)
- The Erdős-Sós conjecture for spiders (Q2462374) (← links)
- Tree embeddings (Q2712588) (← links)
- Erdős-type condition for a graph to contain \(k\) independent edges (Q2741374) (← links)
- Ramsey numbers for trees (Q2907031) (← links)
- Turán Numbers of Multiple Paths and Equibipartite Forests (Q3103631) (← links)
- On the Loebl-Koml�s-S�s conjecture (Q4506067) (← links)
- A Local Approach to the Erdös--Sós Conjecture (Q4631099) (← links)
- (Q4984769) (← links)
- Bipartite version of the Erdös-Sós conjecture (Q5195877) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
- Constructing trees in graphs with no <i>K</i><sub>2,<i>s</i></sub> (Q5434262) (← 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)
- A Spectral Erdős-Sós Theorem (Q6072289) (← links)
- How connectivity affects the extremal number of trees (Q6500097) (← links)
- Spectral extremal results on trees (Q6574373) (← links)
