Almost All C::4::-Free Graphs Have Fewer than (1-epsilon), ex(n, C::4::) Edges

József Balogh, Wojciech Samotij. Almost All C::4::-Free Graphs Have Fewer than (1-epsilon), ex(n, C::4::) Edges. SIAM J. Discrete Math., 24(3):1011-1018, 2010. [doi]

Abstract

Abstract is missing.