paper

Vertex-minors and the Erdős-Hajnal conjecture

arXiv:1804.11008 · doi:10.1016/j.disc.2018.09.007

Abstract

We prove that for every graph , there exists such that every -vertex graph with no vertex-minors isomorphic to has a pair of disjoint sets , of vertices such that and is complete or anticomplete to . We deduce this from recent work of Chudnovsky, Scott, Seymour, and Spirkl (2018). This proves the analog of the Erdős-Hajnal conjecture for vertex-minors.

4 pages. Minor update

Vertex-minors and the Erdős-Hajnal conjecture · wovepaper