Pages that link to "Item:Q2813338"
From MaRDI portal
The following pages link to The Erdős-Hajnal conjecture for long holes and antiholes (Q2813338):
Displaying 22 items.
- Erdős-Hajnal-type theorems in hypergraphs (Q713978) (← links)
- Mangoes and blueberries (Q1125684) (← links)
- Erdős and Rényi conjecture (Q1268624) (← links)
- Excluding hooks and their complements (Q1671647) (← links)
- Decomposition techniques applied to the clique-stable set separation problem (Q1709553) (← links)
- Vertex-minors and the Erdős-Hajnal conjecture (Q1800420) (← links)
- Erdős-Hajnal for cap-free graphs (Q1984528) (← links)
- Pure pairs. II: Excluding all subdivisions of a graph (Q2043764) (← links)
- Submodular functions and rooted trees (Q2095463) (← links)
- Pure pairs. I: Trees and linear anticomplete pairs (Q2213783) (← links)
- Towards Erdős-Hajnal for graphs with no 5-hole (Q2288355) (← links)
- The Erdős-Hajnal conjecture for paths and antipaths (Q2347853) (← links)
- A note on weighted rooted trees (Q2515593) (← links)
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor (Q2662350) (← links)
- The Erdős-Hajnal conjecture. A survey (Q2874098) (← links)
- Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement (Q2911494) (← links)
- For most graphs <i>H</i> , most <i>H</i> -free graphs have a linear homogeneous set (Q2930050) (← links)
- Weighted Rooted Trees: Fat or Tall? (Q5042262) (← links)
- On low rank-width colorings (Q5918207) (← 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)
- Strong Erdős-Hajnal properties in chordal graphs (Q6574376) (← links)
