University of Cambridge > Talks.cam > Combinatorics Seminar > Counting graphic sequences

  Browse A-Z

Log in

University Account External (via Google)

šŸ” Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ā„¹ļø Information

Counting graphic sequences

Download to your calendar using vCal

  • UserPaul Balister (Oxford)
  • ClockThursday 18 May 2023, 14:00-15:00
  • HouseMR12.

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))4n/n{3/4}$ for some constant $c>0$, improving both the previously best upper and lower bounds by a factor of $n^{1/4+o(1)}$. The proof relies on a translation of the problem into one concerning integrated random walks.

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:

Note that ex-directory lists are not shown.

Other lists

The Pavilion Room, Hughes Hall Internet Service Providers W4.03

Other talks

Ensemble inequivalence for systems with long-range interactions Title to be confirmed What Can a Spectrum Learn? AI Perspectives on the Kohn Laplacian of Sphere Quotients Title TBC Title to be confirmed The Play Paradox: How video games build better humans
 

Ā© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity