Balanced independent sets in graphs omitting large cliques

TL;DR

This paper explores balanced independent sets in infinite graphs avoiding large cliques, establishing exact bounds and properties related to colorings, embeddings, and Ramsey numbers, advancing understanding of structure in $K_n$-free graphs.

Contribution

It determines the minimal number of colors needed to guarantee large independent sets in infinite $K_n$-free graphs and confirms a conjecture relating to Henson's universal graphs.

Findings

Exact value of $r(H_n,m)$ expressed via Ramsey numbers.

Existence of large independent sets meeting multiple color classes.

A new partition property of Henson's graphs for bipartite embeddings.

Abstract

Our goal is to investigate a close relative of the independent transversal problem in the class of infinite $K_n$-free graphs: we show that for any infinite $K_n$-free graph $G=(V,E)$ and $m\in \mathbb N$ there is a minimal $r=r(G,m)$ such that for any balanced $r$-colouring of the vertices of $G$ one can find an independent set which meets at least $m$ colour classes in a set of size $|V|$. Answering a conjecture of S. Thomass\'e, we express the exact value of $r(H_n,m)$ (using Ramsey-numbers for finite digraphs), where $H_n$ is Henson's countable universal homogeneous $K_n$-free graph. In turn, we deduce a new partition property of $H_n$ regarding balanced embeddings of bipartite graphs: for any finite bipartite $G$ with bipartition $A,B$, if the vertices of $H_n$ are partitioned into two infinite classes then there is an induced copy of $G$ in $H_n$ such that the images of $A$ and $B$ are contained in different classes.