14 citations · 52 across the 41 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013★ 14 cited
On the number of graphs without large cliques
Frank Mousset, Rajko Nenadov, Angelika Steger
In 1976 Erdos, Kleitman and Rothschild determined the number of graphs without a clique of size . In this note we extend their result to the case of forbidden cliques of incr…
math.CO2013★ 3 cited
Universality of random graphs and rainbow embedding
Asaf Ferber, Rajko Nenadov, Ueli Peter
In this paper we show how to use simple partitioning lemmas in order to embed spanning graphs in a typical member of . Let the \emph{maximum density} of a graph be the…