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 14 items.
- 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)
- The Erdős-Sós conjecture for spiders (Q2462374) (← links)
- (Q2712588) (← links)
- Turán Numbers of Multiple Paths and Equibipartite Forests (Q3103631) (← links)
- (Q4506067) (← links)
- An approximate version of the Loebl-Komlós-Sós conjecture (Q5895546) (← links)