The following pages link to (Q3220603):
Displaying 8 items.
- 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)
- Packing of graphs - a survey (Q1825885) (← 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)
- A Local Approach to the Erdös--Sós Conjecture (Q4631099) (← links)
- A note on an SLLN of Dvoretzky-Erdös type (Q6101715) (← links)
