Almost all C4-free graphs have fewer than (1 - ε)ex(n, C4) edges

Jozsef Balog, Wojciech Samotij

Research output: Contribution to journalArticle

Fingerprint Dive into the research topics of 'Almost all C<sub>4</sub>-free graphs have fewer than (1 - ε)ex(n, C<sub>4</sub>) edges'. Together they form a unique fingerprint.

Mathematics