Pages that link to "Item:Q276193"

The following pages link to On Erdős-Sós conjecture for trees of large size (Q276193):

Displaying 14 items.

• On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices (Q389980) (← links)
• The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars (Q1010834) (← links)
• The Erdös-Sós conjecture for graphs without \(C_ 4\) (Q1362105) (← links)
• Arbitrarily large jumps of the Golovach function for trees (Q1759500) (← links)
• On the Erdős-Sós conjecture for graphs with circumference at most \(k+1\) (Q2089550) (← links)
• On the Erdős-Sós conjecture for graphs with circumference at most \(k\) (Q2799805) (← links)
• A Local Approach to the Erdös--Sós Conjecture (Q4631099) (← links)
• A variant of the Erdős‐Sós conjecture (Q5110682) (← links)
• Maximum and Minimum Degree Conditions for Embedding Trees (Q5128507) (← links)
• Degree Conditions for Embedding Trees (Q5232383) (← links)
• The Erdős‐Sós Conjecture for trees of diameter four (Q5311919) (← links)
• On the Erdős–Sós conjecture for trees with bounded degree (Q5886108) (← links)
• A Spectral Erdős-Sós Theorem (Q6072289) (← links)
• How connectivity affects the extremal number of trees (Q6500097) (← links)