Programme

For a pdf file of the programme click here. All participants will receive a copy in their registration packet.

Below you find the full programme with links to all the papers.

Monday
Tuesday
Wednesday
Thursday
Friday

Monday

Monday 31 August
08:00 onwards	Registration desk is open (in hotel lobby)
08:45 – 10:00	Daniel Lokshtanov: Graph Modification Problems (all plenary sessions/invited talks in Terminus Hall upstairs from lobby)
10:00 – 10:30	Coffee break (all coffee breaks outside Terminus Hall. NB: 3 minute walk to rooms for contributed talks next to lobby)
	Forskjønnelsen	Bull	Welhaven	Amundsen
10:30 – 10:55	Asaf Ferber, Gal Kronenberg and Eoin Long Packing, Counting and Covering Hamilton cycles in random directed graphs	Ben Barber, Daniela Kühn, Allan Lo and Deryk Osthus Edge-decompositions of graphs with high minimum degree	Jiří Fiala, Jan Hubička and Yangjing Long An universality argument for graph homomorphisms	Chris Godsil, David Roberson, Brendan Rooney, Robert Šámal and Antonios Varvitsiotis Graph Cores via Universal Completability
10.55 – 11.20	Clément Requilé and Juanjo Rué Triangles in random cubic planar graphs	Silvia Messuti, Vojtěch Rödl and Mathias Schacht Packing minor closed families of graphs	Ewan Davies Counting in hypergraphs via regularityin heritance	Gabor Wiener On non-traceable, non-hypotraceable, arachnoid graphs
11.20 – 11.45	Michael Krivelevich, Matthew Kwan and Benny Sudakov Cycles and matchings in randomly perturbed digraphs and hypergraphs	Jaehoon Kim, Daniela Kühn and Deryk Osthus Bipartitions of highly connected tournaments
11.45 – 12.10	Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang and Kathrin Skubch How does the core embed into the mantle?	Chun-Hung Liu and Sang-Il Oum Partitioning H-minor free graphs into three subgraphs with no large components
12:15 – 14:00	Lunch (all lunches served in Brasseriet (where breakfast served), Welhaven and Amundsen)
14:00 – 15:00	Van Vu : Anti-concentration Inequalities
15:00 – 15:30	Coffee break
	Forskjønnelsen	Bull	Welhaven	Amundsen
15:30 – 15:55	Jan van den Heuvel, Patrice Ossona de Mendez, Roman Rabinovich and Sebastian Siebertz On the generalised colouring numbers of graphs that exclude a fixed minor	Tina Janne Schmidt, Cristina Fernandes and Anusch Taraz On Minimum Bisection and Related Partition Problems in Graphs with Bounded Tree Width	Sigve Hortemo Sæther and Martin Vatshelle Hardness of computing width parameters based on branch decompositions over the vertex set	Benny Sudakov and Jan Volec Properly colored and rainbow copies of graphs with few cherries
15:55 – 16:20	Bojan Mohar and Hehui Wu Triangle-free subgraphs with large fractional chromatic number	Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang and Daniël Paulusma Bounding the Clique-Width of H-free Split Graphs	Ngoc Le, Christoph Brause and Ingo Schiermeyer The Maximum Independent Set Problem in Subclass of S_i,j,k Free Graphs	Nina Kamcev, Michael Krivelevich and Benny Sudakov Some Remarks on Rainbow Connectivity
16:20 – 16:45	Konstanty Junosza-Szaniawski First non-trivial upper bound on circular chromatic number of the plane.	Matthew Johnson, Daniel Paulusma and Erik Jan van Leeuwen What Graphs are 2-Dot Product Graphs?	Pavel Dvořák and Tomáš Valla On the Computational Complexity and Strategies of Online Ramsey Theory	Gabriel Nivasch and Eran Omri Rainbow matchings and algebras of sets
16:45 – 17:10	Julien Bensmail, Marthe Bonamy and Hervé Hocquard Strong edge coloring sparse graphs	Tamon Stephen and Timothy Yusun The Circuit Diameter of the Klee-Walkup Polytope	Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Balázs Patkós, Gábor Wiener and Mate Vizer Finding a majority ball with majority answers	Carlos Hoppen, Hanno Lefmann and Knut Odermann A rainbow Erd̋os-Rothschild problem
17:30 – ca 20:00	Meet outside hotel 17:30. European Prize in Combinatorics Ceremony at University Museum, starting at 18:00, including concert with Tora Augestad and Stian Carstensen, followed by a reception

Tuesday

Tuesday 1 September
08:50 – 10:00	Maria Chudnovsky: Coloring square-free perfect graphs
10:00– 10:30	Coffee break
	Forskjønnelsen	Bull	Welhaven	Amundsen
10:30 – 10:55	Jacob Cooper, Tomas Kaiser, Daniel Kral and Jonathan Noel Weak regularity and finitely forcible graph limits	Carl Feghali, Matthew Johnson and Daniel Paulusma Kempe Equivalence of Colourings of Cubic Graphs	Marcia R. Cerioli and Taisa L. Martins Structural Results for General Partition, Equistable and Triangle graphs	Dániel Korándi, Yuval Peled and Benny Sudakov A random triadic process
10:55 – 11:20	Jaroslav Nesetril and Patrice Ossona De Mendez Structural Limits and Approximations of Maps	Ilia Akolzin and Dmitry Shabanov Colorings of hypergraphs with large number of colors	Richard Lang, Oliver Schaudt and Maya Stein Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles	Alexey Pokrovskiy Rainbow matchings and connectedness of coloured graphs
11:20 – 11:45	Endre Csóka On the graph limit question of Vera T. Sós	Felix Joos and Henning Bruhn A stronger bound for the strong chromatic index
11:45 – 12:10	Richard Lang and Maya Stein Local colourings and monochromatic partitions in complete bipartite graphs	Michael Hebdige and Daniel Kral Third case of the Cyclic Coloring Conjecture
12:15 – 14:00	Lunch
14:00 – 15:00	Talk by Karim Adiprasito, winner of European Prize in Combinatorics
16:00 – 20:00	Excursion, upon arrival sign up for Mountain Hike (meet 16:00 in Forskjønnelsen) or City Tour (meet 16:00 in Bull)

Wednesday

Wednesday 2 September
08:50 – 10:00	Talk by Rob Morris, winner of European Prize in Combinatorics
10:00 – 10:30	Coffee break
	Forskjønnelsen	Bull	Welhaven	Amundsen
10:30 – 10:55	Jan Hubička and Jaroslav Nešetřil Ramsey classes with forbidden homomorphisms and a closure	Eoin Long Large unavoidable subtournaments	Sergio Cabello, Bojan Mohar and Robert Samal Drawing a disconnected graph on the torus	Mikael Hansson The Bruhat order on conjugation invariant sets of involutions in the symmetric group
10:55 – 11:20	Martin Balko, Josef Cibulka, Karel Král and Jan Kynčl Ramsey numbers of ordered graphs	Guus Regts Regularity lemma’s in a Banach space setting with applications to approximating matrix norms	Gabriel Nivasch On the zone of a circle in an arrangement of lines	Val Pinciu Guarding Polyominoes, Polycubes and Polyhypercubes
11:20 – 11:45	Peter Allen, Barnaby Roberts and Jozef Skokan Ramsey Numbers of Squares of Paths	Mykhaylo Tyomkyn and Andrew J. Uzzell Strong Turán stability
11:45 – 12:10	Ross J. Kang, Viresh Patel and Guus Regts On a Ramsey-type problem of Erdős and Pach	Shagnik Das and Tuan Tran A simple removal lemma for large nearly intersecting families
12:15 – 14:00	Lunch
14:00 – 16:45	Celebration of 80th birthday of Helge Tverberg, chaired by Jaroslav Nesetril with talks by Imre Bárány and Günter Ziegler
17:30 – ca 23	Conference dinner. Meet outside hotel at 17:30. Boat departure from Bryggen at 18:00 (in front of Radisson Hotel)

Thursday

Thurday 3 September
08:50 – 10:00	Amin Coja-Oghlan, Random Graph Coloring
10:00 – 10:30	Coffee break
	Forskjønnelsen	Bull	Welhaven	Amundsen
10:30 – 10:55	Gill Barequet and Mira Shalah Automatic Proofs for Formulae Enumerating Proper Polycubes	Peter Allen, Julia Boettcher, Yoshiharu Kohayakawa and Barnaby Roberts Triangle Free Subgraphs of Random Graphs	Matthew Jenssen The Multicolour Ramsey Number of a Long Odd Cycle	Irina Shirgazina Equitable colorings of non-uniform simple hypergraphs
10:55 – 11:20	Thomas Krajewski, Iain Moffat and Adrian Tanasa An extension of the Bollobas-Riordan polynomial for vertex partitioned ribbon graphs: definition and universality	Peter Allen, Julia Böttcher, Julia Ehrenmüller and Anusch Taraz Local resilience of spanning subgraphs in sparse random graphs	Dennis Clemens and Yury Person Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs	Ingo Schiermeyer, Christoph Brause, Premysl Holub, Zdenek Ryjacek, Petr Vrana and Rastislav Krivos-Bellus 4-colorability of P6-free graphs
11:20 – 11:45	Henning Bruhn, Laura Gellert and Jacob Günther Jacobsthal numbers in generalised Petersen graphs	Huda Chuangpishit, Mahya Ghandehari and Jeannette Janssen Uniform Linear Embeddings of Spatial Random Graphs
11:45 – 12:10	Anna Taranenko Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs	Olaf Parczyk and Yury Person On spanning structures in random hyper graphs
12:15 – 14:00	Lunch
14:00 – 15:00	Francisco Santos, Enumerating lattice 3-polytopes
15:00 – 15:30	Coffee break
	Forskjønnelsen	Bull	Welhaven	Amundsen
15:30 – 15:55	Noga Alon and Clara Shikhelman Many T copies in H-free graphs	Oliver Cooley, Mihyun Kang and Christoph Koch Evolution of high-order connected components in random hypergraphs	József Balogh, Hong Liu, Maryam Sharifzadeh and Andrew Treglown An exact bound on the number of maximal sum-free sets	Jakub Kozik and Dmitry Shabanov Extremal problems for colorings of simple hypergraphs and applications
15:55 – 16:20	Stefan Glock, Daniela Kühn and Deryk Osthus Optimal path and cycle decompositions of dense quasirandom graphs	Mihyun Kang, Christoph Koch and Tamas Makai Bootstrap percolation in random k- uniform hypergraphs	Elad Aigner-Horev and Hiep Han Arithmetic progressions with a pseudo random step	Shagnik Das, Benny Sudakov and Pedro Vieira Almost-Fisher families
16:20 – 16:45	Shuya Chiba and Nicolas Lichiardopol Vertex-disjoint subgraphs with high degree sums	David Conlon, Asaf Ferber, Rajko Nenadov and Nemanja Skoric Almost-spanning universality in random graphs	Juanjo Rué, Oriol Serra and Lluis Vena Counting configuration–free sets in groups	Peter Allen, Julia Böttcher, Oliver Cooley and Richard Mycroft Regular slices for hypergraphs
16:45 – 17:10	Jaume Martí-Farré, Mercè Mora and José Luis Ruiz Completion and decomposition of hyper-graphs into dominating sets of graphs	Daniela Kuhn, Deryk Osthus and Amelia Taylor On the random greedy F-free hypergraph process	Peter Horak, Igor Semaev and Zsolt Tuza An Application of Combinatorics in Cryptography	Peter Allen, Julia Böttcher, Oliver Cooley and Richard Mycroft Tight cycles in hypergraphs
17:30 – 18:15	Eurocomb Business Meeting

Friday

Friday 4 September
08:50 – 10:00	Pavol Hell, Forbidden structure characterizations of interval and circular arc graphs
10:00 – 10:30	Coffee break
	Forskjønnelsen	Bull	Welhaven	Amundsen
10:30 – 10:55	Fábio Botler, Guilherme O. Mota, Marcio T. I. Oshiro and Yoshiko Wakabayashi Decompositions of Highly Connected Graphs into Paths of Any Given Lengt	Gill Barequet and Ronnie Barequet An improved Upper Bound on the Growth Constant of Polyominoes	Jarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond and Théophile Trunck Induced minors and well-quasi-ordering	Katerina Böhmová, Cristina Dalfó and Clemens Huemer The Diameter of Cyclic Kautz Digraphs
10.55 – 11.20	Fábio Botler, Guilherme O. Mota, Marcio T. I. Oshiro and Yoshiko Wakabayashi Path Decompositions of Regular Graphs with Prescribed Girth	Mihyun Kang and Philipp Sprüssel Characterisation of symmetries of unlabelled triangulations	Gašper Fijavž Bounded face-width forces K₇ minors in orientable surfaces	Dennis Clemens and Mirjana Mikalacki Winning fast in fair biased Maker-Breaker games
11.20 – 11.45	François Dross, Mickael Montassier and Alexandre Pinlou Partitioning a triangle-free planar graph into a forest and a forest of bounded degree	Michael Mosshammer, Philipp Sprüssel, Wenjie Fang and Mihyun Kang Enumeration of cubic multigraphs on orientable surfaces
11.45 – 12.10	Martin Merker Decomposing series-parallel graphs into paths of length 3 and triangles	Miquel Àngel Fiol The spectral excess theorem for distance- regular graphs having distance-d graph with fewer distinct eigenvalues
12:15 – 14:00	Lunch
14:00 – 15:00	Zdenek Dvorak: Detailed structure of embedded 4-critical triangle-free graphs (invited speaker and winner of European Prize in Combinatorics)
15:00 – 15:30	Coffee break
	Forskjønnelsen	Bull	Welhaven	Amundsen
15:30 – 15:55	Paweł Rzażewski, Zbigniew Lonc and Michał Debski Harmonious and achromatic colorings of fragmentable hypergraphs	Katherine Staden and Andrew Treglown On a degree sequence analogue of Pósa’s conjecture	Endre Csóka Limits of some combinatorial problems	Eugenijus Manstavičius and Robertas Petuchovas Permutations without long or short cycles
15:55 – 16:20	Frederic Maffray Even pairs in square-free Berge graphs	Torsten Mütze and Pascal Su Bipartite Kneser graphs are Hamiltonian	Tomasz Krawczyk and Bartosz Walczak Asymmetric coloring games on incompa-rability graphs	Raúl Falcón Classifying partial Latin rectangles
16:20 – 16:45	Eckhard Steffen and Giuseppe Mazzuocollo Nowhere-zero 5-flows	Adam Kabela and Tomas Kaiser 10-tough chordal graphs are hamiltonian	Hans Bodlaender, Pinar Heggernes and Jan Arne Telle Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality	Mohammad Mahdian and Ebadollah Mahmoodian Sudoku Rectangle Completion
16:45 – 17:10	Winfried Hochstättler Towards a Flow-Theory for the Dichromatic Number	Luke Postle On the Minimum Edge-Density of 5-Critical Triangle-Free Graphs	Martin Balko and Pavel Valtr A SAT attack on the Erdős–Szekeres conjecture	Daniel Kotlar and Ran Ziv Decomposition of bi-colored square arrays into balanced diagonals