THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS
Recently, settling a question of Erdős, Balogh, and Petříčková showed that there are at most $2^{n^{2}/8+o(n^{2})}$$n$-vertex maximal triangle-free graphs, matching the previously known lower bound. Here, we characterize the typical structure of maximal triangle-free graphs. We show that almost ever...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Cambridge University Press
2015-10-01
|
| Series: | Forum of Mathematics, Sigma |
| Subjects: | |
| Online Access: | https://www.cambridge.org/core/product/identifier/S2050509415000225/type/journal_article |