English

The Erd\H{o}s-Hajnal property for graphs with no fixed cycle as a pivot-minor

Combinatorics 2021-07-02 v3

Abstract

We prove that for every integer kk, there exists ε>0\varepsilon > 0 such that for every n-vertex graph GG with no pivot-minor isomorphic to CkC_k, there exist disjoint sets A,BV(G)A,B \subseteq V(G) such that A,Bεn|A|,|B| \geq \varepsilon n, and AA is either complete or anticomplete to BB. This proves the analog of the Erd\H{o}s-Hajnal conjecture for the class of graphs with no pivot-minor isomorphic to CkC_k.

Keywords

Cite

@article{arxiv.2003.12960,
  title  = {The Erd\H{o}s-Hajnal property for graphs with no fixed cycle as a pivot-minor},
  author = {Jaehoon Kim and Sang-il Oum},
  journal= {arXiv preprint arXiv:2003.12960},
  year   = {2021}
}

Comments

13 pages, 4 figures