Forbidden subgraphs and complete partitions

John Byrne, Michael Tait, Craig Timmons

A graph is called an $(r,k)$-graph if its vertex set can be partitioned into $r$ parts, each having at most $k$ vertices and there is at least one edge between any two parts. Let $…