Monday, Tuesday, Wednesday, Thursday, Friday
Monday (CEST time zone)  

8:459:00, Mo  Introductory words 

9:0010:00, Mo  Plenary Talk: Josep Díaz, Distances and the reconstruction problem on random geometric graphs. 

10:0010:30, Mo  Break 

10:3011:00, Mo  Rainbow cliques in randomly perturbed dense graphs. AignerHorev, Danon, Hefetz, Letzter.  On the homomorphism order of oriented paths and trees. Hubicka, Nesetril, Oviedo and Serra.  Tuza's Conjecture for threshold graphs. Bonamy et al.  Independence complexes of ternary graphs. Kim 
11:0011:30, Mo  The square of a Hamilton cycle in randomly perturbed graphs. Böttcher, Parczyk, Sgueglia, Skokan  On a question of Vera T. Sós about size forcing of graphons. Cooley, Kang, Pikhurko  Graphs without an induced path on 5 vertices and without an induced dart or kite. Brause, Geißer  Modularity of Johnson graphs. Derevyanko, Koshele, Raigorodskii. 
11:3012:00, Mo  Hamiltonicity of randomly perturbed graphs. Espuny Díaz and Girão  Strong modeling limits of graphs with bounded treewidth. Grzesik, Kráľ and Mohr  Constant congestion brambles in directed graphs. Masařík, Pilipczuk, Rzążewski and Sorge  Integer covering problems and maxnorm Ramsey theorems. Frankl, Kupavskii, Sagdeev 
12:0012:30, Mo  On asymmetric hypergraphs. Jiang, Nešetřil  The Flat Wall Theorem for Bipartite Graphs with Perfect Matchings. Giannopoulou and Wiederrecht  Covering threetori with cubes. Grigoryan, Zhukovskii and Bogdanov. 

12:3014:00, Mo  Lunch Break 

14:0015:00, Mo  Plenary Talk: Marcin Pillipzuk, The Gyárfás’ path argument and algorithms. 

15:0015:30, Mo  Break 

15:3016:00, Mo  The mod k chromatic index of random graphs. Botler, Colucci, Kohayakawa  Large multipartite subgraphs in Hfree graphs. Hu, Lidicky, Martins, Norin and Volec  Bounds on half graph orders in powers of sparse graphs. Sokołowski  On the dichromatic number of surfaces. Aboulker, Havet, Knauer, Rambaud 
16:0016:30, Mo  Loose cores and cycles in random hypergraphs. Cooley, Kang and Zalla.  Max Cuts in Trianglefree Graphs. Balogh, Clemen and Lidický.  Strongly Pfaffian Graphs. Gorsky, Steiner and Wiederrecht.  Robust Connectivity of Graphs on Surfaces. Bradshaw, Masařík, Novotná and Stacho. 
16:3017:00, Mo  On the maximum cut in sparse random hypergraphs. Shabanov and Zakharov  Extremal density for sparse minors and subdivisions. Haslegrave, Kim and Liu.  The Maximum Number of Paths of Length Three in a Planar Graph. Győri, Paulos, Salia, Zamora, Tompkins.  Improved bounds on the cop number of a graph drawn on a surface. Erde and Lehner. 
17:0017:30, Mo  The rainbow Turan number of even cycles. Janzer  No Selection Lemma for Empty Triangles. FabilaMonroy, HidalgoToscano, Perz and Vogtenhuber.  A Short Proof of Euler–Poincaré Formula. Hlineny 
Monday, Tuesday, Wednesday, Thursday, Friday
Tuesday (CEST time zone)  

9:0010:00, Tu  Plenary Talk: Julia Bottcher, Packing trees and other graphs. 

10:0010:30, Tu  Break 

10:3011:00, Tu  An Approximate Structure Theorem for Small Sumsets. Campos, Coulson, Serra, Wötzel  Path decompositions of tournaments. Girão, Granet, Kühn, Lo and Osthus.  Decomposing cubic graphs with cyclic connectivity 5. Máčajová and Rajník.  Approximate MDS Property of Linear Codes. Ganesan 
11:0011:30, Tu  Schur's Theorem for randomly perturbed sets. Das, Knierim and Morris  Trees with few leaves in tournaments. Benford and Montgomery  Long shortest cycle covers in cubic graphs. Macajova and Skoviera.  Hermitian rankmetric codes. Trombetti and Zullo. 
11:3012:00, Tu  Uncommon systems of equations. Kamčev, Liebenau and Morrison  Tight bounds for powers of Hamilton cycles in tournaments. Munhá Correia, Draganić, Sudakov  Counting Circuit Double Covers. Hušek and Šámal  Parallelisms of PG(3,5) with an automorphism group of order 25. Topalova and Zhelezova 
12:0012:30, Tu  A refinement of CauchySchwarz complexity, with applications. Candela, GonzalezSanchez, Szegedy  Nested cycles with no geometric crossing. Gil Fernández, Kim, Kim and Liu  Gallai's path decomposition for planar graphs. Blanché, Bonamy, Bonichon  Lines in the Manhattan plane. Kantor 
12:3014:00, Tu  Lunch Break 

14:0015:00, Tu  Plenary Talk: Will Perkins, From algorithms to combinatorics and back again. 

15:0015:30, Tu  Break 

15:3018:00, Tu  European Prize on Combinatorics Ceremony and Lectures from the Awardees 
Monday, Tuesday, Wednesday, Thursday, Friday
Wednesday (CEST time zone)  

9:0010:00, We  Plenary Talk: David Wood, Universality in minorclosed graph classes. 

10:0010:30, We  Break 

10:3011:00, We  Component behaviour of random bipartite graphs. Anh Do, Erde and Kang  Exchange properties of finite setsystems. Frankl, Pach and Pálvölgyi.  Circular coloring of signed bipartite planar graphs. Naserasr and Wang.  On tangencies among planar curves with an application to coloring Lshapes. Ackerman, Keszegh, Pálvölgyi. 
11:0011:30, We  Long induced paths in sparse random graphs. Glock, Draganić and Krivelevich  On a problem of Füredi and Griggs. Serra and Vena.  The chromatic number of signed graphs with bounded maximum average degree. Jacques and Pinlou.  Outer 1string graphs of girth at least five are 3colorable. Das, Mukherjee, Kant Sahoo. 
11:3012:00, We  Path decompositions of random directed graphs. Espuny Díaz, Patel and Stroh  Maximal kwise \elldivisible set families are atomic. Gishboliner, Sudakov and Tomon.  Decomposing and Colouring Locally OutTransitive Oriented Graphs. Charbit, Aboulker and Aubian.  Coloring Circle Arrangements: New 4Chromatic Planar Graphs. Kwun Chiu et al. 
12:0012:30, We  Cycle saturation in random graphs. Demidovich and Zhukovskii  On Alternation, VCdimension and kfold Union of Sets. Roy and Sarma  On Deeply Critical Oriented Cliques. Duffy, Pavan, Sandeep and Sen  Interval representation of balanced separators in graphs avoiding a minor. Dvořák, Pekárek, Samal 
12:3014:00, We  Lunch Break 

14:0014:15, We  Robin Thomas Memorial Session: Introductory words 

14:1515:15, We  Plenary Talk: Sergei Norin, Connectivity, density and coloring in minorclosed graph classes. 

15:1515:45, We  Zdenek Dvorak, Fractional coloring of bounded degree graphs. 

15:4516:15, We  Dan Kral, Common graphs with large chromatic number. 

16:1516:45, We  Luke Postle, Improving the general bound for Hadwiger’s conjecture. 

16:4517:00, We  Break 

17:0017:30, We  Weak components of the directed configuration model. Coulson and Perarnau  On extremal problems concerning the traces of sets. Piga and Schülke.  Halin's end degree conjecture. Geschke, Kurkofka, Melcher and Pitz.  Unit Disk Visibility Graphs. Agaoglu and Çağırıcı. 
17:3018:00, We  A rainbow connectivity threshold for random graph families. Bradshaw and Mohar  The intersection spectrum of 3chromatic intersecting hypergraphs. Bucic, Glock and Sudakov.  On 13CrossingCritical Graphs with Arbitrarily Large Degrees. Hlineny and Korbela.  Unit disks hypergraphs are threecolorable. Damásdi and Pálvölgyi 
18:0018:30, We  Oriented graphs with lower orientation Ramsey thresholds. Ferreira Barros et al.  Supersaturation, counting, and randomness inforbidden subposet problems. Gerbner, Nagy, Patkos, Vizer.  Tight bounds on the expected number of holes in random point sets. Balko, Scheucher, Valtr.  Discrete Hellytype theorems for pseudohalfplanes. Keszegh 
Monday, Tuesday, Wednesday, Thursday, Friday
Thursday (CEST time zone)  

9:0010:00, Th  Plenary Talk: Christian Krattenthaler, Reciprocity between Dyck paths and alternating sequences  heaps, orthogonal polynomials, ... 

10:0010:30, Th  Break 

10:3011:00, Th  Universal singular exponents in catalytic variable equations. Drmota, Noy, Yu  On ordered Ramsey numbers of tripartite 3uniform hypergraphs. Balko and Vizer.  A trivariate dichromatic polynomial for digraphs. Wiehe and Hochstättler.  Maximising line subgraphs of diameter at most t. Cambie, Cames, de Joannis de Verclos and Kang. 
11:0011:30, Th  On the enumeration of plane bipolar posets and transversal structures. Fusy, Narmanli, Schaeffer.  Ramsey expansions of 3hypertournaments. Cherlin, Hubička, Konečný and Nešetřil.  Vector Choosability in Bipartite Graphs. Chawin and Haviv.  Comparison between metric dimension and zero forcing number. Bousquet, Deschamps, Parreau and Pelayo. 
11:3012:00, Th  On the Number of Compositions of Two Polycubes. Asinowski et al.  The Ramsey number for 4uniform tight cycles. Lo and Pfenninger.  Fractional chromatic number of double cones over graphs. Zhu and Zhu.  Constructions of betweennessuniform graphs from trees. Pokorná and Hartman. 
12:0012:30, Th  The expected number of perfect matchings in cubic planar graphs. Noy, Requilé, Rué.  On Multicolour Ramsey Numbers and SubsetColouring of Hypergraphs. Jartoux, Keller, Smorodinsky, Yuditsky.  On chromatic number of (n, m)graphs. Lahiri, Nandi, Taruni and Sen.  New bounds on kgeodetic digraphs and mixed graphs. Tuite and Erskine 
12:3014:00, Th  Lunch Break 

14:0014:30, Th  Counting C_kfree orientations of G(n,p). Campos, Collares, Mota  Stability of extremal connected hypergraphs avoiding Bergepaths. Gerbner, Nagy, Patkós, Salia.  Efficient Reconfiguration of Vertex Colouring. Biedl, Lubiw, Merkel.  Enumerating descents on quasiStirling permutations and plane trees. Elizalde 
14:3015:00, Th  On the maximum number of weaklyrainbowfree edgecolorings. Hoppen, Lefmann and Nolibos.  Hypergraphs with minimum positive uniform Turan density. Garbe, Kral and Lamaison.  Kempe changes in bounded treewidth graphs. Bonamy, Delecroix and LegrandDuchesne.  Chipfiring on the complete split graph: Motzkin words and tiered parking functions. Dukes 
15:0015:30, Th  Asymptotics for connected graphs and irreducible tournaments. Monteil and Nurligareev.  Unavoidable hypergraphs. Bucić, Draganic, Sudakov and Tran.  2distance (D+1)coloring of sparse graphs using the potential method La, Montassier.  Graphs whose sandpile group has fixed number of generators. Alfaro, Barrus, Sinkovic and Villagrán. 
15:3016:00, Th  Random 2cell embeddings of multistars. Campion Loth et al.  Diractype conditions for spanning boundeddegree hypertrees. Pavez, Sanhueza and Stein.  Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length. Kırtışoğlu and Özkahya.  Kissing number in nonEuclidean spaces of constant sectional curvature. Dostert and Kolpakov 
16:0016:30, Th  Break 

16:3017:30, Th  Plenary Talk: Lisa Sauerman, Finding distinctvariable solutions to linear equations in (F_p)^n. 

17:3017:45, Th  Break 

17:4518:30, Th  Business Meeting 
Monday, Tuesday, Wednesday, Thursday, Friday
Friday (CEST time zone)  

9:0010:00, Fr  Plenary Talk: Louis Esperet, Universal graphs and applications. 

10:0010:30, Fr  Break 

10:3011:00, Fr  Cut vertices in random planar graphs. Kang and Missethan.  Big Ramsey degrees and forbidden cycles. Balko et al.  Complexity of 3+1/mcoloring P_tfree graphs. Jacques and Ochem.  Low Diameter Algebraic Graphs. Bui, Bui, Le and Mai. 
11:0011:30, Fr  The Ising antiferromagnetic in the replica symmetric phase. Fabian and Loick  GallaiRamsey number for complete graphs. Schiermeyer and Magnant.  A simple (2+\epsilon)approximation algorithm for Split Vertex Deletion. Drescher, Fiorin, Huynh.  Some results on the Laplacian spectra of token graphs. Dalfó et al. 
11:3012:00, Fr  Semirandom process without replacement. Gilboa and Hefetz  On offdiagonal ordered Ramsey numbers of nested matchings. Balko and Poljak.  Classification of Local Problems on Paths. Grebík, Rozhoň.  Size of local finite field Kakeya sets. Ganesan 
12:0012:30, Fr  Local convergence of random planar graphs. Stufler  Big Ramsey degrees of the generic partial order. Balko et al.  A SAT attack on higher dimensional ErdösSzekeres numbers. Scheucher  Characterization of FSdouble Squares Ending with Two Distinct Squares. Patawar and Kapoor. 
12:3014:00, Fr  Lunch Break 

14:0014:30, Fr  The game of Toucher and Isolator. Dowden, Kang, Mikalački and Stojaković  Degree conditions for tight Hamilton cycles. Lang and Sanhueza Matamala.  On Bipartite Sum Basic Equilibria. Àlvarez and Messegué  
14:3015:00, Fr  MakerBreaker games with constraints. Forcan and Mikalački  Cycles of Many Lengths in Hamiltonian Graphs. Gishboliner, Bucic and Sudakov.  Preimages under Queuesort Cioni, Ferrari.  
15:0015:30, Fr  Results on the Graceful Game and RangeRelaxed Graceful Game. Oliveira, Dantas and Luiz.  Powers of Hamilton cycles of high discrepancy are unavoidable. Bradač  Graphs where Search Methods are Indistinguishable. Krnc and Pivač.  
15:3016:00, Fr  WaiterClient Games on Randomly Perturbed Graphs. Clemens, Hamann, Mogge, Parczyk.  On sufficient conditions for Hamiltonicity. Lang and Sanhueza Matamala.  Sorting by shuffling methods and a queue. Dimitrov  
16:0016:30, Fr  Break 

16:3017:30, Fr  Plenary Talk: Eva Tardos, Stability and Learning in Strategic Queueing Systems. 

17:3017:45, Fr  Closing Words 