# Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs

@article{Chudnovsky2020PurePI,
title={Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs},
author={M. Chudnovsky and Jacob Fox and Alex D. Scott and Paul D. Seymour and Sophie Theresa Spirkl},
journal={J. Graph Theory},
year={2020},
volume={95},
pages={315-340}
}
A graph is "$H$-free" if it has no induced subgraph isomorphic to $H$. A conjecture of Conlon, Fox and Sudakov states that for every graph $H$, there exists $s>0$ such that in every $H$-free graph with $n>1$ vertices, either some vertex has degree at least $sn$, or there are two disjoint sets of vertices, of sizes at least $sn^s$ and $sn$, anticomplete to each other. We prove this holds for a large class of graphs $H$, and we prove that something like it holds for all graphs $H$. Say $H$ is… Expand
5 Citations

#### Topics from this paper

Towards Erdős-Hajnal for Graphs with No 5-Hole
• Computer Science, Mathematics
• Comb.
• 2019
This paper improves the general bound of Erdos and Hajnal, that for all H, $H$, $\max(\alpha(G),\omega(G))\ge 2^{\Omega(\sqrt{\log n })}$ if $G$ is $H$-free. Expand
Ramsey goodness of books revisited
• Jacob Fox, Xiaoyu He
• Mathematics
• 2021
The Ramsey number r(G,H) is the minimum N such that every graph onN vertices contains G as a subgraph or its complement contains H as a subgraph. For integers n ≥ k ≥ 1, the k-book Bk,n is the graphExpand
Pure pairs. IX. Bonsai trees
• 2021
Fix k > 0, and let G be a graph, with vertex set partitioned into k subsets (“blocks”) of approximately equal size. An induced subgraph of G is “bonsai” (with respect to this partition) if it hasExpand
Pure pairs. IX. Transversal trees
• Alex Scott
• Mathematics
• 2021
Fix k > 0, and let G be a graph, with vertex set partitioned into k subsets (“blocks”) of approximately equal size. An induced subgraph of G is “transversal” (with respect to this partition) if itExpand
3 1 O ct 2 02 1 Pure pairs . IX . Transversal trees
• Alex Scott
• 2021
Fix k > 0, and let G be a graph, with vertex set partitioned into k subsets (“blocks”) of approximately equal size. An induced subgraph of G is “transversal” (with respect to this partition) if itExpand