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]
@article{BaloghS10,
title = {Almost All C::4::-Free Graphs Have Fewer than (1-epsilon), ex(n, C::4::) Edges},
author = {József Balogh and Wojciech Samotij},
year = {2010},
doi = {10.1137/09074989X},
url = {http://dx.doi.org/10.1137/09074989X},
tags = {graph-rewriting, C++, rewriting},
researchr = {https://researchr.org/publication/BaloghS10},
cites = {0},
citedby = {0},
journal = {SIAM J. Discrete Math.},
volume = {24},
number = {3},
pages = {1011-1018},
}