Pages that link to "Item:Q2288355"
From MaRDI portal
The following pages link to Towards Erdős-Hajnal for graphs with no 5-hole (Q2288355):
Displaying 14 items.
- No odd pairs in minimal imperfect NP\({}_{5}\) graphs. (Q1853069) (← links)
- Erdős-Hajnal-type results for monotone paths (Q1984509) (← links)
- Erdős-Hajnal for cap-free graphs (Q1984528) (← links)
- A superlinear lower bound on the number of 5-holes (Q2306008) (← links)
- Erdős-Lovász Tihany conjecture for graphs with forbidden holes (Q2312803) (← links)
- The Erdős-Hajnal conjecture for long holes and antiholes (Q2813338) (← links)
- Induced \(C_5\)-free graphs of fixed density: counting and homogeneous sets (Q2857341) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- Polynomial bounds for chromatic number II: Excluding a star‐forest (Q6057629) (← links)
- Erdős–Hajnal for graphs with no 5‐hole (Q6075068) (← links)
- Graphs with no induced house nor induced hole have the de Bruijn–Erdös property (Q6081879) (← links)
- Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs (Q6138779) (← links)
- Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph (Q6144408) (← links)
- Pure Pairs. IX. Transversal Trees (Q6188521) (← links)
