Monday 7
| 8:30-9:30 | Registration at Agora-Haut Carré | |||
| 9:45-10:00 | Opening | |||
| 10:00-11:00 | Xuding Zhu : Total weight choosability of graphs | |||
| 11:00-11:20 | Coffee break | |||
| Lecture Room A | Lecture Room B | Lecture Room C | Lecture Room D | |
| 11:25-11:50 | Li-Da Tong Full Orientability of Graphs | Vadim Lozin Parameterized complexity of the maximum independent set problem and the speed of hereditary properties | Zoltán Füredi and Attila Sali Partition Critical Hypergraphs | Emilie Diot and Cyril Gavoille On the Path Separability of Planar Graphs |
| 11:50-12:15 | Joergen Bang-Jensen and Matthias Kriesell Disjoint sub(di)graphs in digraphs | Cédric Bentz New results on planar and directed multicuts | Rommel Barbosa, Mitre Dourado, Erika Martins and Jayme Szwarcfiter The Colorful Helly Property for Hypergraphs | Min Chen and André Raspaud Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable |
| 12:15-14:00 | Lunch | |||
| 14:00-15:00 | Stéphan Thomassé : Kernelization via combinatorial Optimizations | |||
| 15:00-15:30 | Coffee break | |||
| Lecture Room A | Lecture Room B | Lecture Room C | Lecture Room D | |
| 15:30-15:55 | Ehsan Chiniforooshan and Baoyindureng Wu Maximum values of Szeged index and edge-Szeged index of graphs | Cedric Chauve, Jan Manuch and Murray Patterson On the Gapped Consecutive Ones Property | Roland Grappe, Attila Bernáth and Zoltán Szigeti Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph | Zdenek Dvorak and Bojan Mohar Spectral radius of finite and infinite planar graphs and of graphs of bounded genus |
| 15:55-16:20 | Abhijin Adiga and Sunil L Chandran Cubicity of Interval Graphs and the Claw Number | Guillaume Fertin and Stéphane Vialette On the S-Labeling problem | Hanno Lefmann, Carlos Hoppen and Yoshiharu Kohayakawa Kneser Colorings of Uniform Hypergraphs | Nicolas Sonnerat and Adrian Vetta Defending Planar Graphs against Star-Cutsets |
| 16:20-16h40 | Coffee break | |||
| 16:40-17:05 | Friedrich Eisenbrand and Martin Niemeier Coloring Fuzzy Circular Interval Graphs | Luke Postle, Noah Streib and Carl Yerger Pebbling Graphs of Diameter Three and Four | Ervin Gyori and Nathan Lemons Hypergraphs with no odd cycle of given length | Delia Garijo, Ángeles Garrido, Clara I. Grima, Alberto Márquez, Auxiliadora Moreno-González, Jose Ramón Portillo, Pedro Reyes, Rafael Robles and Jesús Valenzuela Monochromatic geometric k-factors in red-blue sets with white and Steiner points |
| 17:05-17:30 | Ilan Goldfeder and Hortensia Galeana-Sanchez A classification of arc-locally semicomplete digraphs | Tomoki Nakamigawa, Shinya Fujita and Tadashi Sakuma Colored Pebble Motion on Graphs | Allan Lo Cliques in graphs with bounded minimum degree | Nicole Eggemann and Steven Noble Minimizing the Oriented Diameter of a Planar Graph |
Tuesday 8
| 9:00-10:00 | Anders Björner: A q-analogue of the FKG inequality and some applications | |||
| 10:00-10:30 | Coffee break | |||
| Lecture Room A | Lecture Room B | Lecture Room C | Lecture Room D | |
| 10:30-10:55 | Anna Huber and Nikolaos Fountoulakis Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting | Mareike Massow and Stefan Felsner Linear Extension Diameter of Downset Lattices of 2-Dimensional Posets | Yury Person and Mathias Schacht An expected polynomial time algorithm for coloring $2$-colorable $3$-graphs | Patrice Ossona de Mendez and Jaroslav Nesetril Counting Homomorphisms to Sparse Graphs |
| 10:55-11:20 | Benjamin Doerr and Mahmoud Fouz A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading | Ronnie Barequet, Gill Barequet and Guenter Rote Formulae and Growth Rates of High-Dimensional Polycubes | Dmitry Shabanov and Anastasia Rozovskaya On the Problem of Erdos and Hajnal in the Case of List Colorings | Henning Bruhn and Maya Stein Characterising claw-free t-perfect graphs |
| 11:30-11:55 | Benjamin Doerr, Tobias Friedrich and Thomas Sauerwald Quasirandom Rumor Spreading on Expanders | Anna Lladó and Jordi Moragas On the Sumset Partition Problem | Daniel Kral, Edita Macajova, Jan Mazak and Jean-Sebastien Sereni Circular edge-colorings of cubic graphs with girth six | Oliver Cooley, Jan Hladky and Diana Piguet Loebl-Komlos-Sos Conjecture |
| 11:55-12:20 | Amanda Montejano and Oriol Serra Rainbow--free 3--colorings in abelian groups | Nathann Cohen, Frederic Havet and Tobias Mueller Acyclic edge-colouring of planar graphs. Extended abstract | Peter Allen, Julia Böttcher, Jan Hladký and Oliver Cooley Minimum degree conditions for large subgraphs | |
| 12:20-14:00 | Lunch | |||
| 14:00-15:00 | Michaël Krivelevich: Hamiltonicity problems in random graphs | |||
| 15:00-16:00 | Coffee break & Posters | |||
| Lecture Room A | Lecture Room B | Lecture Room C | Lecture Room D | |
| 16:00-16:25 | Deryk Osthus, Daniela Kuehn and Luke Kelly Short cycles in oriented graphs | Michel Habib and Juraj Stacho A Decomposition Theorem for Chordal Graphs and its Applications | Zoltan Furedi and Lale Ozkahya Unavoidable subhypergraphs | Luke Postle, Arash Asadi and Robin Thomas Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs |
| 17:30 | "Docteur Honoris Causa" ceremony - cocktail | |||
Wednesday 9
| 9:00-10:00 | Penny Haxell: Packing and covering in hypergraphs | |||
| 10:00-10:30 | Coffee break | |||
| Lecture Room A | Lecture Room B | Lecture Room C | Lecture Room D | |
| 10:30-10:55 | Guy Wolfovitz 4-cycles at the triangle-free process | Yulia Kempner and Vadim Levit Distributive Lattice Polyhedra | Yared Nigussie Extended Gallai's Theorem | Kenta Ozeki Spanning trees in $3$-connected $K_{3,t}$-minor-free graphs |
| 10:55-11:20 | Reto Spöhel, Angelika Steger and Henning Thomas Coloring the edges of a random graph without a monochromatic giant component | Kolja Knauer Chip-Firing, Antimatroids, and Polyhedra | Oleg Rubanov and Andrei Raigorodskii Small clique and large chromatic number | Roland Häggkvist Ear decompositions of a cubic bridgeless graph and near P4-decompositions of its deck |
| 11:30-11:55 | Nikolaos Fountoulakis and Bruce Reed A general critical condition for the emergence of a giant component in random graphs with given degrees | Delia Garijo, Andrew Goodall and Jaroslav Nesetril Graph homomorphisms, the Tutte polynomial and q-state Potts uniqueness | Edita Macajova and Martin Skoviera On a Conjecture of Fan and Raspaud | Agelos Georgakopoulos Every rayless graph has an unfriendly partition |
| 11:55-12:20 | Konstantinos Panagiotou and Makrand Sinha Vertices of Degree k in Random Unlabeled Trees | Criel Merino, Marcelino Ramírez and M. Guadalupe Rodríguez A note on some inequalities for the Tutte polynomial of a matroid | Ross Kang and Putra Manggala On distance edge-colourings and matchings | Binh-Minh Bui-Xuan and Michel Habib Unifying the representation of symmetric crossing families and weakly partitive families |
| 12:20-14:00 | Lunch | |||
| 14:00-15:00 | Martin Loebl: Optimization by Enumeration | |||
| 15:00-18:00 | Excursion | |||
| 18:30-19:30 | European Prize | |||
| 19:30-20:30 | Degustation | |||
| 20:30-24:00 | Banquet | |||
Thursday 10
| 9:00-10:00 | Bojan Mohar: Is there a structural graph theory based on the spectral radius? | |||
| 10:00-10:30 | Coffee break | |||
| Lecture Room A | Lecture Room B | Lecture Room C | Lecture Room D | |
| 10:30-10:55 | Tomer Kotek On the reconstruction of graph invariants | Emeric Gioan and Michel Las Vergnas A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements | Julia Böttcher and Sybille Müller Forcing spanning subgraphs via Ore type conditions | Archontia Giannopoulou and Dimitrios Thilikos Obstructions for Tree-depth |
| 10:55-11:20 | Cristina Dalfó, Miquel Ŕngel Fiol and Ernest Garriga On t-Cliques in k-Walk-Regular Graphs | Juanjo Rué, Konstantinos Stavropoulos and Dimitrios Thilikos Outerplanar Obstructions for the Feedback Vertex Set | Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou and Stéphan Thomassé Spanning galaxies in digraphs | Youssou Dieng and Cyril Gavoille On the Tree-Width of Planar Graphs |
| 11:30-11:55 | Dan Hefetz, Michael Krivelevich, Milos Stojakovic and Tibor Szabo Avoider-Enforcer | Bernard Ries Some properties of edge intersection graphs of single bend paths on a grid | Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi and Tadashi Sakuma Disjoint Even Cycles Packing | Vitaliy Koshelev On Erdös--Szekeres-type problems |
| 11:55-12:20 | Noga Alon, Dan Hefetz and Michael Krivelevich Playing to retain the advantage | Demetres Christofides Randomized algorithms for the majority problem | Louis Esperet, Frantiek Kardo and Daniel Kráľ Cubic bridgeless graphs have more than a linear number of perfect matchings | Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz and Bettina Speckmann Flip Graphs of Bounded-Degree Triangulations |
| 12:20-14:00 | Lunch | |||
| 14:00-15:30 | Prize winning lectures | |||
| 15:30-16:30 | Coffee break & Posters | |||
| 16:30-16:55 | Diana Piguet, Julia Böttcher and Jan Hladky The tripartite Ramsey number for trees | Ľubomír Török, Imrich Vrťo, Stefan Dobrev, Rastislav Královič and Dana Pardubská Antibandwidth and Cyclic Antibandwidth of Hamming Graphs | Andrei Raigorodskii and Andrei Kupavskii On the chromatic numbers of small-dimensional Euclidean spaces | Oriol Serra and Gilles Zemor Cycle codes of graphs and MDS array codes |
| 16:55-17:20 | Charles Delorme, Evelyne Flandrin, Yuqing Lin, Mirka Miller and Joe Ryan On Extremal Graphs with Bounded Girth | William Kennedy, Conor Meagher and Bruce Reed Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time | Mike J. Grannell, Terry S. Griggs, Edita Macajova and Martin Skoviera Wilson-Schreiber Colourings of Cubic Graphs | Paul Dorbec, Sylvain Gravier, Iiro Honkala and Michel Mollard Weighted codes in Lee metric |
| 17:20-17:55 | Stephan Brandt and Elizabeth Ribe-Baumann Graphs of odd girth 7 with large degree | Martin Tancer d-collapsibility is NP-complete for d greater or equal to 4 | Ida Kantor and Zoltan Furedi List colorings with distinct list sizes, the case of complete bipartite graphs | David Auger Identifying Codes in Trees and Planar Graphs |
Friday 11
| 9:00-10:00 | Bruno Courcelle: Logical characterizations of graph hierarchies | |||
| 10:00-10:30 | Coffee break | |||
| Lecture Room A | Lecture Room B | Lecture Room C | Lecture Room D | |
| 10:30-10:55 | Geoffrey Exoo and Robert Jajcay Properties of Groups for the Cage and Degree/Diameter Problems | Simone Rinaldi, Filippo Disanto, Luca Ferrari and Renzo Pinzani Combinatorial properties of Catalan pairs | Daniela Kuehn, Deryk Osthus and Andrew Treglown Degree sequences forcing Hamilton cycles in directed graphs | Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé and Laurent Vuillon Codings of rotations on two intervals are full |
| 10:55-11:20 | Petr Gregor Hypercube 1-factorizations from extended Hamming codes | Anna de Mier and Marc Noy On the maximum number of cycles in outerplanar and series-parallel graphs | Olivier Togni $\ell$-distant Hamiltonian walks in Cartesian product graphs | Amanda Montejano, Alexandre Pinlou, André Raspaud and Éric Sopena Chromatic number of sparse colored mixed planar graphs |
| 11:30-11:55 | Zoltan Furedi and Lale Ozkahya On even-cycle-free subgrqaphs of the hypercube | Domingos, Jr Dellamonica and Vojtech Rodl Hereditary quasi-random properties of hypergraphs | Tomas Kaiser and Petr Vrana Hamilton cycles in 6-connected claw-free graphs (Extended abstract) | Marcin Kaminski, Paul Medvedev and Martin Milanic On the Plane-Width of Graphs |
| 11:55-12:20 | Tomá Dvořák, Jiří Fink, Petr Gregor and Václav Koubek Long paths and cycles in faulty hypercubes | Louis Esperet, Daniel Gonçalves and Arnaud Labourel Coloring a set of touching strings | Jan Hladky, Daniel Kral and Sergey Norin Counting flags in triangle-free digraphs | Otfried Cheong, Xavier Goaoc and Andreas Holmsen Lower Bounds for Pinning Lines by Balls |
| 12:20-14:00 | Lunch | |||
| 14:00-15:00 | Janos Pach: Ordnung muss sein! -- Plane curves and partial orders | |||
| 15:00-15:30 | Coffee break | |||
| 15:30-15:55 | Petter Branden Discrete concavity and zeros of polynomials | Le Anh Vinh On the distribution of permanents of matrices over finite fields | Hervé Hocquard and Mickaël Montassier Acyclic choosability of planar graphs: a Steinberg like approach | |
| 15:55-16:20 | Luis Pedro Montejano, Camino Balbuena and Pedro García Vázquez On the Superconnectivity in graphs with odd girth g and even girth h | Francesc Aguiló-Gost and Pedro A García-Sánchez. Factorization and catenary degree in 3-generated numerical semigroups | ||








