Pages that link to "Item:Q1884650"

The following pages link to The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\) (Q1884650):

Displaying 10 items.

• A sufficient degree condition for a graph to contain all trees of size \(k\) (Q546277) (← links)
• A variation of a conjecture due to Erdös and Sós (Q1034303) (← links)
• The maximum number of cycles in the complement of a tree (Q1101118) (← links)
• The Erdös-Sós conjecture for graphs without \(C_ 4\) (Q1362105) (← links)
• A note on embedding graphs without short cycles (Q1883254) (← links)
• The Erdös-Sós conjecture for graphs of girth 5 (Q1916132) (← links)
• Erdős-type condition for a graph to contain \(k\) independent edges (Q2741374) (← links)
• The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) (Q3642864) (← links)
• Embedding trees in graphs with independence number two (Q4577857) (← links)
• On the Erd�s-S�s conjecture (Q4865531) (← links)