Pages that link to "Item:Q2911494"

The following pages link to Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement (Q2911494):

Displaying 11 items.

• Excluding paths and antipaths (Q520043) (← links)
• Erdős-Hajnal-type theorems in hypergraphs (Q713978) (← links)
• Erdős-Hajnal for cap-free graphs (Q1984528) (← links)
• Pure pairs. II: Excluding all subdivisions of a graph (Q2043764) (← links)
• Towards Erdős-Hajnal for graphs with no 5-hole (Q2288355) (← links)
• The Erdős-Hajnal conjecture for paths and antipaths (Q2347853) (← links)
• The Erdős-Hajnal conjecture for long holes and antiholes (Q2813338) (← links)
• The Erdős-Hajnal conjecture. A survey (Q2874098) (← links)
• For most graphs <i>H</i> , most <i>H</i> -free graphs have a linear homogeneous set (Q2930050) (← links)
• Erdős–Hajnal for graphs with no 5‐hole (Q6075068) (← links)
• Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs (Q6138779) (← links)