Combinatorics Seminar

When: Sunday, November 29, 10am
Where: Schreiber 309
Speaker: Péter Erdős, Rényi Institute
Title: On degree sequences problems


In this talk we will survey a series of old and new degree sequence problems for simple graphs, bipartite graphs and directed graphs. The general questions are:
  • the graphicality of a given degree sequence,
  • how to construct all possible realizations,
  • the connectivity problem of any two realizations under the swap operations,
  • finally, the sampling problem of these realizations.

    The first three problem classes are elementary combinatorics, but one cannot always expect elementary answers. The last problem class is highly technical.