![]() |
![]() |
University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Rational Turan exponents
![]() Rational Turan exponentsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Richard Montgomery. 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\in[1,2] is realisable if there exists a graph F with ex(n , F) = \Theta(n^r). Erdos and Simonovits conjectured that every rational number in [1,2] is realisable. We show that 2- a/b is realisable for any integers a,b \geq 1 with b>a and b \equiv \pm 1 mod a. This includes all previously known realisable numbers. This is joint work with Dong Yeap Kang and Hong Liu. This talk is part of the Combinatorics and Probability seminar series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsDinner Table Terrorism - Achieving Food Security Featured lists Type the title of a new list hereOther talksLife : it’s out there, but what and why ? TBC TBA TBA Quantum Sensing in Space TBA |