English

Vertex-minors and the Erd\H{o}s-Hajnal conjecture

Combinatorics 2018-10-05 v2

Abstract

We prove that for every graph HH, there exists ε>0\varepsilon>0 such that every nn-vertex graph with no vertex-minors isomorphic to HH has a pair of disjoint sets AA, BB of vertices such that A,Bεn|A|, |B|\ge \varepsilon n and AA is complete or anticomplete to BB. We deduce this from recent work of Chudnovsky, Scott, Seymour, and Spirkl (2018). This proves the analog of the Erd\H{o}s-Hajnal conjecture for vertex-minors.

Keywords

Cite

@article{arxiv.1804.11008,
  title  = {Vertex-minors and the Erd\H{o}s-Hajnal conjecture},
  author = {Maria Chudnovsky and Sang-il Oum},
  journal= {arXiv preprint arXiv:1804.11008},
  year   = {2018}
}

Comments

4 pages. Minor update