Pages that link to "Item:Q1916132"
From MaRDI portal
The following pages link to The Erdös-Sós conjecture for graphs of girth 5 (Q1916132):
Displayed 27 items.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← 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)
- A randomized embedding algorithm for trees (Q555509) (← 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)
- On graphs which contain each tree of given size (Q1356784) (← links)
- The Erdös-Sós conjecture for graphs without \(C_ 4\) (Q1362105) (← 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)
- A variation of the Erdős-Sós conjecture in bipartite graphs (Q2014230) (← links)
- Subdivisions in digraphs of large out-degree or large dichromatic number (Q2315440) (← links)
- The Erdős-Sós conjecture for spiders (Q2462374) (← links)
- Tree embeddings (Q2712588) (← links)
- Turán Numbers of Multiple Paths and Equibipartite Forests (Q3103631) (← links)
- On the Loebl-Koml�s-S�s conjecture (Q4506067) (← links)
- Embedding trees in graphs with independence number two (Q4577857) (← links)
- A Local Approach to the Erdös--Sós Conjecture (Q4631099) (← 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)
- 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)
- Connectivity preserving trees in <i>k</i>‐connected or <i>k</i>‐edge‐connected graphs (Q6046680) (← links)
- A Spectral Erdős-Sós Theorem (Q6072289) (← links)
- Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result (Q6094046) (← links)