2 papers
math.CO2009
On the Density of a Graph and its Blowup
Asaf Shapira, Raphael Yuster
The theorem of Chung, Graham, and Wilson on quasi-random graphs asserts that of all graphs with edge density p, the random graph G(n,p) contains the smallest density of copies of K…
math.CO2009
Multigraphs (only) satisfy a weak triangle removal lemma
Asaf Shapira, Raphael Yuster
The triangle removal lemma states that a simple graph with o(n^3) triangles can be made triangle-free by removing o(n^2) edges. It is natural to ask if this widely used result can…