The indivisibility of the homogeneous \(K_ n\)-free graphs (Q1823962)

A graph G is indivisible if for every partition of the vertex set of G into two classes R and B there is an isomorphic copy of G either in R or in B. Every homogeneous \(K_ n\)-free graph \(H_ n\), \(n\geq 3\), is indivisible. This result extends the result of \textit{P. Komjáth} and \textit{V. Rödl} [Graphs Comb. 2, 55-60 (1986; Zbl 0589.05053)] which proves that \(H_ 3\) is indivisible.