![]() |
![]() |
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 listsTheoretical Physics Seminars Jane Langdale Chemical Engineering Research Seminar SeriesOther talksThe percolating cluster is invisible to image recognition with deep learning Many-body localization from Hilbert- and real-space points of view [Friday seminar]: Irradiated brown dwarfs in the desert Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Signatures of structural criticality and universality in the cellular anatomy of the brain Topological magnons and quantum magnetism |