Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges (Q3008023): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:34, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges |
scientific article |
Statements
Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges (English)
0 references
17 June 2011
0 references
asymptotic graph structure
0 references
asymptotic graph enumeration
0 references
\(C_4\)-free
0 references
Turán's problem
0 references
extremal graphs
0 references
