Workshop description
Graph theory and combinatorics are thriving fields, closely connected to many other areas of Mathematics such as probability, topology, numbertheory and geometry, as well as optimization and algorithms. Recently, computational aspects are also becoming more and more central to the core theoretical problems of the field. These include flag algebras, reinforcement learning and other AI approaches, including machine assisted proof verification and computer algebra systems. This workshop will cover a broad spectrum of topics from analytic, enumerative, extremal and probabilistic combinatorics, as well as random graphs. Talks will expose the latest trends and methods in these areas and provide a springboard for future collaboration amongst participants.
Speakers
Semi-plenary speakers
- Bonamy, Marthe - CNRS and Université de Bordeaux, France
- Heule, Marijn - Carnegie Mellon University, United States of America
Invited speakers
- Balogh, József - University of Illinois, United States
- Campos, Marcelo - University of Oxford, England
- Falgas-Ravry, Victor - Umeå University, Sweden
- Grzesik, Andrzej - Jagiellonian University, Poland
- Kamčev, Nina - University of Zagreb, Croatia
- Karam, Thomas - University of Oxford, England
- Kiem, Aldo - Konrad Zuse Institute and TU Berlin, Germany
- Lidický, Bernard - Iowa State University, United States of America
- Mond, Adva - Cambridge University, United Kingdom
- Parczyk, Olaf - Freie Universität Berlin, Germany
- Spiegel, Christoph - Zuse Institute Berlin, Germany
- Tan, Jane - University of Oxford, England
- Versteegen, Leo - University of Cambridge, United Kingdom
- Volec, Jan - Czech Technical University in Prague, Czech Republic
Preliminary program
This schedule is preliminary and could be updated.
Monday, June 12
| 14:00 ~ 15:00 | Exponential improvement on diagonal ramsey numbers Marcelo Campos - University of Oxford, England |
| 15:00 ~ 15:30 | On percolation in locally dependent random graphs Victor Falgas-Ravry - Umeå University, Sweden |
| 15:30 ~ 16:00 | Minimum degree edge-disjoint Hamilton cycles in random directed graphs Adva Mond - Cambridge University, United Kingdom |
| 16:30 ~ 17:30 | Flag Algebras and Weighted Turán Theorems Bernard Lidický - Iowa State University, United States |
| 17:30 ~ 18:00 | New Ramsey Multiplicity Bounds and Search Heuristics Olaf Parczyk - FU Berlin, Germany |
| 18:00 ~ 18:30 | The total domination game Leo Versteegen - University of Cambridge, UK |
Tuesday, June 13
| 14:00 ~ 15:00 | Nearly all k-SAT functions are unate Jozsef Balogh - University of Illinois, United States |
| 15:00 ~ 15:30 | 6th diagonal Ramsey number is at most 147 Jan Volec - Czech Technical University in Prague, Czeh Republic |
| 15:30 ~ 16:00 | Forcing Generalized Quasirandom Graphs Efficiently Andrzej Grzesik - Jagiellonian University, Poland |
| 16:30 ~ 17:00 | Common linear patterns are rare Nina Kamčev - University of Zagreb, Croatia |
| 17:00 ~ 17:30 | Towards flag algebras in additive combinatorics Christoph Spiegel - Zuse Institute Berlin, Germany |
| 17:30 ~ 18:30 | Graph classes and their Asymptotic Dimension Marthe Bonamy - CNRS, Université de Bordeaux, France |
Wednesday, June 14
| 14:00 ~ 14:30 | Reconstructing 3D cube complexes from boundary distances Jane Tan - University of Oxford, United Kingdom |
| 14:30 ~ 15:00 | The 4-color Ramsey Multiplicity of Triangles Aldo Kiem - Zuse Institute Berlin and TU Berlin, Germany |
| 15:30 ~ 16:00 | The fragmentation technique on the ranks of tensors and its applications. Thomas Karam - University of Oxford, United Kingdom |
| 16:30 ~ 17:30 | A SAT Approach to the Hadwiger-Nelson Problem Marijn Heule - Carnegie Mellon University, United States |
Posters
- A polynomial-time algorithm to find a minimal word representing a tree permutationally
Khyodeno Mozhui - Indian Institute of Technology Guwahati, India - Sorting Signed Permutations by Tandem Duplication Random Loss and Inverse Tandem Duplication Random Loss
Bruno J. Schmidt - Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany - Rainbow Clique Subdivisions
Yan Wang - Shanghai Jiao Tong University, China - Complete non-ambiguous trees and associated permutations: connections through the Abelian sandpile model
Haoyue Zhu - Xi'an Jiaotong-Liverpool University, China