| Saturday 4. |
|
Arrival |
Tereza Klimosova – Constant-Time Approxamtion Algorithms via Local Improvements |
Martin Koutecky – Solving Hard Problems on Neighborhood Diversity |
| Sunday 5. |
Extremal Set Theory, part 1 – Ladislav Laska |
Extremal Set Theory, part 2 – Martin Bohm |
Extremal Set Theory, part 3 – Peter Zeman |
| Monday 6. |
Josef Tkadlec – Pebbling Graphs of Fixed Diameter |
Peter Korcsok – Extremal graphs without 4-cycles |
Peter Horak – surprise |
Pavel Dvorak – Automorphisms of multidimensional tic-tac-toe |
| Tuesday 7. |
Additive Combinatorics, Testing linear transformations – Karel Tesar |
Additive Combinatorics, Sidon sets – Tomas Toufar |
Additive Combinatorics, Dense models of pseudorandom sets – Vojta Tuma |
| Wednesday 8. |
(trip) |
(trip) |
Jakub Bulin – Algebraic approach to CSP and coloring by oriented trees |
Pavel Klavik – Introduction to Chaos |
| Thursday 9. |
Entropy Compression, part 1 |
Entropy Compression, part 2 |
Entropy Compression, part 3 |
| Friday 10. |
Tomas Masarik – An independent set approach to ... GPS III |
Michal Rolinek – On a coloring conjecture about unit fractions |
Martin Derka – Planar Emulators Conjecture Is Nearly True for Cubic Graphs |
| Saturday 11. |
Incidence Theorems, part 1 |
Incidence Theorems, part 2 |
Incidence Theorems, part 3 |
| Sunday 12. |
Laszlo Ozsvart – The non-crossing graph |
Robert Lukotka – A simpler proof for the two disjoint odd cycles theorem |
Departure |