Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs
From MaRDI portal
Publication:6138779
DOI10.1007/s40687-023-00413-yzbMath1530.05091arXiv2210.10755OpenAlexW4389948002MaRDI QIDQ6138779
Pablo Javier Blanco, Matija Bucić
Publication date: 16 January 2024
Published in: Research in the Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.10755
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Excluding paths and antipaths
- Ramsey-type theorems
- The Erdős-Hajnal conjecture for bull-free graphs
- Erdős-Hajnal-type results for monotone paths
- Erdős-Hajnal for cap-free graphs
- Pure pairs. II: Excluding all subdivisions of a graph
- Pure pairs. I: Trees and linear anticomplete pairs
- Towards Erdős-Hajnal for graphs with no 5-hole
- The Erdős-Hajnal conjecture for paths and antipaths
- On a property of the class of n-colorable graphs
- Crossing patterns of semi-algebraic sets
- The Erdös--Hajnal Conjecture for Long Holes and Antiholes
- Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement
- Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs
- Ramsey-type theorems with forbidden subgraphs
- Erdős–Hajnal for graphs with no 5‐hole
- Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
This page was built for publication: Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs
