Programme
Main Speakers
The workshop takes place on 16-18 August. The dinner is planned for Thursday 17 August at the restaurant Pakhuis. On Saturday 19 August, we organise an optional trip to Bruges as a social activity.
The booklet containing the abstracts and other practical information is also available to download. Note that every participant will receive a printed copy, so there is no need to print this yourself.
Wednesday August 16
09h15 - 09h55 | Registration |
09h55 - 10h00 | Welcome |
10h00 - 10h55 |
Graph generation and Ramsey numbers Brendan McKay |
10h55 - 11h20 | Coffee break |
11h20 - 11h45 |
Recent progress towards a proof of the 4-4-4-Conjecture František Kardoš |
11h50 - 12h15 |
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs Domenico Labbate |
12h15 - 14h30 | Lunch |
14h30 - 14h55 |
Snarks that cannot be covered with four perfect matchings Edita Máčajová |
15h00 - 15h25 |
Construction of snarks with circular flow number 5 Giuseppe Mazzuoccolo |
15h30 - 15h55 |
Smallest snarks with oddness 4 Martin Škoviera |
15h55 - 16h10 | Coffee break |
16h10 - 16h35 |
Extension of graphs on surfaces to 3-colorable triangulations Kenta Ozeki |
16h40 - 17h05 |
Some Folkman Problems Stanisław Radziszowski |
Thursday August 17
10h00 - 10h55 |
Nash-Williams' cycle decomposition theorem (blackboard talk) Carsten Thomassen |
10h55 - 11h20 | Coffee break |
11h20 - 11h45 |
Longer cycles in essentially 4-connected planar graphs Jens M. Schmidt |
11h50 - 12h15 |
On the number of type-0 triangles Gunnar Brinkmann |
12h15 - 14h30 | Lunch |
14h30 - 14h55 |
Minimum leaf number of cubic graphs Gábor Wiener |
15h00 - 15h25 |
A 7/6-approximation algorithm for 2EC in 3-edge connected cubic graphs Roman Čada |
15h30 - 15h55 |
2-factors and independent sets in edge-chromatic critical graphs Eckhard Steffen |
15h55 - 16h10 | Coffee break |
16h10 - 17h00 | Problem session |
19h00 - 22h00 | Conference dinner |
Friday August 18
10h00 - 10h55 |
Crossing Lemmas János Pach |
10h55 - 11h20 | Coffee break |
11h20 - 11h45 |
Finding triangles for maximum planar subgraphs Andreas Schmid |
11h50 - 12h15 |
Strengthening some complexity results on toughness of graphs Kitti Varga |
12h15 - 14h30 | Lunch |
14h30 - 14h55 |
Data reduction and combinatorics of the 3-colorability problem Oliver Schaudt |
15h00 - 15h25 |
Equitable 3-colorability for P_{5}-free graphs Vera Weil |
15h30 - 15h55 |
Graph isomorphism and asymmetric graphs Pascal Schweitzer |
15h55 - 16h10 | Coffee break |
16h10 - 16h35 |
An asymptotically improved upper bound on the diameter of polyhedra Noriyoshi Sukegawa |
16h40 - 17h05 |
PHOEG Helps Obtaining Extremal Graphs Hadrien Mélot |
17h05 - 17h20 | Closing remarks |