2000 character limit reached
Pivot-minors and the Erdős-Hajnal conjecture
Published 16 May 2023 in math.CO | (2305.09133v4)
Abstract: We prove a conjecture of Kim and Oum that every proper pivot-minor-closed class of graphs has the strong Erd\H{o}s-Hajnal property. More precisely, for every graph $H$, there exists $\epsilon > 0$ such that every $n$-vertex graph with no pivot-minor isomorphic to $H$ contains two sets $A, B$ of vertices such that $|A|, |B| \ge \epsilon n$ and $A$ is complete or anticomplete to $B$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.