Random discrete structures can be used to model a large variety of objects in Physics, Biology or Computer Science. They also bring exciting new mathematical challenges and developments which will be exemplified by the participants in this thematic session, which gathers a number of leading researchers in the field.
Schedule
Friday 11:00 – 11:30, Sala Nicolau d’Olwer
Benjamin Sudakov (ETH Zürich)
Cycle packing ► ABSTRACT
Friday 11:40 – 12:10, Sala Nicolau d’Olwer
Juanjo Rué (Freie Universität Berlin)
Arithmetic removal lemmas and independent sets in hypergraphs ► ABSTRACT
Friday 12:20 – 12:50, Sala Nicolau d’Olwer
Colin McDiarmid (University of Oxford)
Counting and typical parameters for phylogenetic networks ► ABSTRACT
Saturday 16:30 – 17:00, Sala Prat de la Riba
Dieter Mitsche (Université Nice Sophia Antipolis)
On rigidity with sliders, orientability and cores of random graphs ► ABSTRACT
Saturday 17:10 – 17:40, Sala Prat de la Riba
Guillem Perarnau (McGill University, Montreal)
Acyclic edge colourings of graphs with large girth ► ABSTRACT
Saturday 17:50 – 18:20, Sala Prat de la Riba
Ignasi Sau (CNRS, LIRMM, Montpellier)
On the Erdős–Pósa property for minors of graphs ► ABSTRACT
Saturday 18:30 – 19:00, Sala Prat de la Riba
Lefteris Kirousis (University of Athens and CTI & Press)
On the algorithmic Lovász Local Lemma and acyclic edge coloring ► ABSTRACT
Organisers
Michael Drmota (Technische Universität Wien)
Oriol Serra (Universitat Politècnica de Catalunya, Barcelona)
