Upcoming Talks

Combinatorics Seminar

Title: Degree sequences of random uniform hypergraphs
Speaker: Tamás Makai (LMU München)
Date: Friday 7th October 14:15
Room: Online meeting (Webex)

Consider the probability that a random graph selected uniformly from the set of $r$-uniform hypergraphs with $n$ vertices and $m$ edges, has a given degree sequence. Previously the value of this probability has been investigated by Kamčev, Liebenau and Wormald, where they examined degree sequences from very sparse to moderately dense hypergraphs when $r=o\left(n^{1/4}\right)$ and the variation of the degrees is small, but exceeds the typical degree variation in random hypergraphs.

We extend their results, by establishing this result for dense hypergraphs, which hold for any value of $r$ and allow for a greater variation on the degrees.

This is joint work with Catherine Greenhill, Mikhail Isaev and Brendan McKay.

Meeting link:

Meeting number: 2730 500 3129

Password: vQydpg372D4