University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Counting cycles in planar graphs

## Counting cycles in planar graphsAdd to your list(s) Download to your calendar using vCal - Ryan Martin (Iowa State University)
- Thursday 07 December 2023, 15:00-16:00
- Poynting Small Lecture Theatre (S06).
If you have a question about this talk, please contact Dr. Jan Kurkofka. Basic Turán theory asks how many edges a graph can have, given certain restrictions such as not having a large clique. A more generalized Turán question asks how many copies of a fixed subgraph There has been a great deal of recent interest in the case where the restriction is planarity. In this talk, we will discuss some of the general results in the field, primarily the asymptotic value of In particular, we will focus on the case where We will discuss recent progress on this problem, including verification of the conjecture in the case where The maximum likelihood problem is, in and of itself, an interesting question in random graph theory. This is joint work with Emily Heath and Chris (Cox) Wells. This talk is part of the Combinatorics and Probability seminar series. ## This talk is included in these lists:- Combinatorics and Probability seminar
- Poynting Small Lecture Theatre (S06)
- School of Mathematics events
Note that ex-directory lists are not shown. |
## Other listsPhysics and Astronomy Colloquia Centre for Systems Biology Coffee Mornings Birmingham Popular Maths Lectures## Other talksQuantum Sensing in Space Life : it’s out there, but what and why ? Waveform modelling and the importance of multipole asymmetry in Gravitational Wave astronomy TBA TBA TBA |