The typical structure of graphs with no large cliques
Sign Up to like & getrecommendations! Published in 2017 at "Combinatorica"
DOI: 10.1007/s00493-015-3290-9
Abstract: In 1987, Kolaitis, Prömel and Rothschild proved that, for every fixed r∈ℕ, almost every n-vertex Kr+1-free graph is r-partite. In this paper we extend this result to all functions r = r(n) with r ⩽… read more here.
Keywords: graphs large; large cliques; typical structure; structure graphs ... See more keywords