The Erdos-Hajnal property for graphs with no fixed cycle as a pivot-minor

Abstract

We prove that for every integer k, there exists > 0 such that for every n-vertex graph G with no pivot-minor isomorphic to Ck, there exist disjoint sets A,B ⊂eq V(G) such that |A|,|B| ≥ n, and A is either complete or anticomplete to B. This proves the analog of the Erdos-Hajnal conjecture for the class of graphs with no pivot-minor isomorphic to Ck.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…