Erdős–Hajnal for graphs with no 5‐hole

DOI10.1112/plms.12504zbMath1521.05078arXiv2102.04994OpenAlexW3127936178MaRDI QIDQ6075068

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

Publication date: 20 September 2023

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Hajnal conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Pure pairs. X. Tournaments and the strong Erdős-Hajnal property ⋮ A further extension of Rödl's theorem ⋮ Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs ⋮ The regularity of almost all edge ideals ⋮ Pure Pairs. IX. Transversal Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey-type theorems
• The Erdős-Hajnal conjecture for bull-free graphs
• On universality of graphs with uniformly distributed edges
• Excluding hooks and their complements
• 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
• Caterpillars in Erdős-Hajnal
• Crossing patterns of semi-algebraic sets
• The Erdös--Hajnal Conjecture for Long Holes and Antiholes
• Edge Distribution of Graphs with Few Copies of a Given Graph
• Some remarks on the theory of graphs
• Ramsey-type theorems with forbidden subgraphs

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