Pages that link to "Item:Q5311919"
From MaRDI portal
The following pages link to The Erdős‐Sós Conjecture for trees of diameter four (Q5311919):
Displaying 23 items.
- 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)
- A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277) (← links)
- The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars (Q1010834) (← links)
- Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs (Q1045015) (← links)
- Gaps in the saturation spectrum of trees (Q1630934) (← links)
- An Erdős-Gallai type theorem for vertex colored graphs (Q2000563) (← 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)
- Spectral radius conditions for the existence of all subtrees of diameter at most four (Q2685383) (← links)
- Turán Numbers of Multiple Paths and Equibipartite Forests (Q3103631) (← links)
- Embedding trees in graphs with independence number two (Q4577857) (← links)
- A Local Approach to the Erdös--Sós Conjecture (Q4631099) (← links)
- The spectral radius of graphs without trees of diameter at most four (Q4992649) (← links)
- Hypergraphs Not Containing a Tight Tree with a Bounded Trunk (Q5232133) (← links)
- A Spectral Erdős-Sós Theorem (Q6072289) (← links)
- Edges Not Covered by Monochromatic Bipartite Graph (Q6081803) (← links)
- How connectivity affects the extremal number of trees (Q6500097) (← links)
- Strong 2-degenerate graph embeddings (Q6551190) (← links)
- On the Turán number of edge blow-ups of cliques (Q6606916) (← links)
- Trimming forests is hard (unless they are made of stars) (Q6654119) (← links)
