Combinatorial Theory Seminar

Please note that the list below only shows forthcoming events, which may not include regular events that have not yet been entered for the forthcoming term. Please see the past events page for a list of all seminar series that the department has on offer.

Past events in this series
19 November 2019
Endre Csóka

Further Information: 

We analyze the asymptotic relative size of the largest independent set of a random d-regular graph on n → ∞ vertices. This problem is very different depending on d because of a surprising phase transition. This is somewhat similar to finding the density of ``water'' above and below its freezing point. These phase transitions are related to algorithmic thresholds, mixing properties, counting, graph reconstruction, graph limits and other questions. We are still far from a complete understanding of all these questions. Our tools are partially coming from statistical physics. 

  • Combinatorial Theory Seminar
Add to My Calendar