Name
Abstract | ||
|---|---|---|
The extremal number ex(n,F) of a graph F is the maximum number of edges in an n-vertex graph not containing F as a subgraph. A real number r∈[1,2] is realisable if there exists a graph F with ex(n,F)=Θ(nr). Several decades ago, Erdős and Simonovits conjectured that every rational number in [1,2] is realisable. Despite decades of effort, the only known realisable numbers are 0,1,75,2, and the numbers of the form 1+1m, 2−1m, 2−2m for integers m≥1. In particular, it is not even known whether the set of all realisable numbers contains a single limit point other than the two numbers 1 and 2. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.jctb.2020.12.003 | Journal of Combinatorial Theory, Series B |
Keywords | DocType | Volume |
Turán numbers,Extremal number | Journal | 148 |
ISSN | Citations | PageRank |
0095-8956 | 0 | 0.34 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dong Yeap Kang | 1 | 11 | 3.97 |
| Jaehoon Kim | 2 | 0 | 0.34 |
| Hong Liu | 3 | 39 | 8.54 |