COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Counting graphic sequencesAdd to your list(s) Download to your calendar using vCal - Paul Balister (Oxford)
- Thursday 18 May 2023, 14:00-15:00
- MR12.
If you have a question about this talk, please contact HoD Secretary, DPMMS. Note 2pm start Given an integer $n$, let $G(n)$ be the number of integer sequences
$n−1≥d_1≥d_2≥⋯≥d_n≥0$ that are the degree sequence of some graph. We show that
$G(n)=(c+o(1))4 Joint work with Serte Donderwinkel, Carla Groenland, Tom Johnston and Alex Scott. This talk is part of the Combinatorics Seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsObstetrics & Gynaecology DevBio Computer Laboratory Security Group meeting presentations## Other talksGroup Work Formalizing algebraic number theory, recent progress and future challenges Multiple cluster scattering and other approaches for modelling and optimization of large wave energy parks Seminar – UPF: a need for clarification to enhance public health policies Learning the dynamics and interactions of moving cells Modular bootstrap for compact Calabi-Yau threefolds |