Caterpillars in Erdős-Hajnal

DOI10.1016/j.jctb.2018.09.002zbMath1414.05166arXiv1810.00811OpenAlexW2893140165MaRDI QIDQ2421547

Anita Liebenau, Sophie Spirkl, Marcin Pilipczuk, P. D. Seymour

Publication date: 17 June 2019

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

induced subgraphsErdős-Hajnal conjecturecaterpillars

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (7)

Erdős–Hajnal for graphs with no 5‐hole ⋮ Pure Pairs. IX. Transversal Trees ⋮ Graphs of large chromatic number ⋮ Pure pairs. I: Trees and linear anticomplete pairs ⋮ On low rank-width colorings ⋮ Pure pairs. II: Excluding all subdivisions of a graph ⋮ Large Homogeneous Submatrices

Cites Work

• Ramsey-type theorems
• On universality of graphs with uniformly distributed edges
• Excluding hooks and their complements
• Pure pairs. I: Trees and linear anticomplete pairs
• The Erdős-Hajnal conjecture for paths and antipaths
• The Erdös-Hajnal Conjecture-A Survey
• Graph Theory and Probability
• Erdos-Hajnal conjecture for graphs with bounded VC-dimension
• Induced Ramsey-type theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Caterpillars in Erdős-Hajnal