The typical structure of graphs with no large cliques

József Balogh, Neal Bushaw, Maurício Collares Neto +3

In 1987, Kolaitis, Prömel and Rothschild proved that, for every fixed $r\in \mathbb{N}$, almost every $n$-vertex $K_{r+1}$-free graph is $r$-partite. In this paper we extend this…