Towards Erdős-Hajnal for graphs with no 5-hole

DOI10.1007/S00493-019-3957-8zbMath1449.05148arXiv1803.03588OpenAlexW2978963187MaRDI QIDQ2288355

Sophie Spirkl, Jacob Fox, Maria Chudnovsky, P. D. Seymour, Alexander D. Scott

Publication date: 17 January 2020

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.03588

zbMATH Keywords

stable setextremal problemscliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Polynomial bounds for chromatic number II: Excluding a star‐forest ⋮ Erdős–Hajnal for graphs with no 5‐hole ⋮ Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs ⋮ Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph ⋮ Pure Pairs. IX. Transversal Trees ⋮ Erdős-Hajnal-type results for monotone paths ⋮ Erdős-Hajnal for cap-free graphs

This page was built for publication: Towards Erdős-Hajnal for graphs with no 5-hole