|
(Monday 10)
17:30-20:00 |
Registration |
|
8:30-9:30
|
Registration
|
|
9:30-10:30
|
Locally
Constrained Graph Homomorphisms: From Graph Covers to Frequency Assignment
Jan Kratochvil
|
|
10:30-11:00
|
Coffee
break
|
|
|
lecture
room A
|
lecture
room B
|
lecture
room C
|
|
11:00-11:20
|
Removing degeneracy may require unbounded dimension
increase
Jiří
Matoušek and Petr Škovroň
|
The t-improper chromatic number of random graphs
Ross
Kang and Colin McDiarmid
|
On Mixed Codes with Covering Radius 1 and Minimum
Distance 2
W.
Haas and J. Quistorff
|
|
11:20-11:40
|
How many points can be reconstructed from k projections?
Jiří
Matoušek, Aleš Přívětivý and Petr Škovroň
|
The order of the largest complete minor in a random
graph
Nikolaos
Fountoulakis, Daniela Kühn and Deryk Osthus
|
On circle graphs with girth at
least five
Louis Esperet and Pascal Ochem
|
|
11:40-12:00
|
On embedding triconnected cubic graphs on point sets
Alfredo
García, Ferran Hurtado, Clemens Huemer, Javier Tejel and Pavel Valtr
|
Deterministic Random Walks on Regular Trees
Joshua
Cooper, Benjamin Doerr, Tobias Friedrich and Joel Spencer
|
SPT(q,k,n)-codes
Attila
Sali and László Székely
|
|
12:00-12:20
|
New results on lower bounds for the number of at
most k-facets
Oswin
Aichholzer, Jesús García, David Orden and Pedro Ramos
|
Lattice paths with periodic boundaries
Joseph
PS Kung, Anna de Mier, Xinyu Sun and Catherine Yan
|
A fast algorithm to generate Beckett-Gray codes
Joe
Sawada and Dennis Chi-Him Wong
|
|
12:20-14:30
|
Lunch
|
|
14:30-15:30
|
Random graphs
on surfaces
Colin J.H. McDiarmid
|
|
15:30-16:00
|
Coffee
break
|
|
|
lecture
room A
|
lecture
room B
|
lecture
room C
|
|
16:00-16:20
|
On the Erdös -- Szekeres problem
Vitaliy
A. Koshelev
|
Measurable sets with excluded distances
Boris
Bukh
|
Removing Even Crossings on Surfaces
Michael
J. Pelsmajer, Marcus Schaefer and
Daniel Štefankovič
|
|
16:20-16:40
|
Characterization of affine Steiner triple systems
and Hall triple systems
Daniel
Král’, Edita Máčajová, Attila Pór and Jean-Sébastien Sereni
|
Finding Paths Between Graph Colourings:
Computational Complexity and Possible Distances
Paul
Bonsma, Luis Cereceda, Jan van den Heuvel and Matthew Johnson
|
The crossing number of a projective graph is
quadratic in the face-width
Isidoro
Gitler, Petr Hlinený, Jesus Leaños and Gelasio Salazar
|
|
16:40-17:00
|
Functions over finite fields that determine few
directions
Simeon
Ball
|
On the Chromatic Numbers of R2 and R3
with Intervals of Forbidden Distances
Leonid
L. Ivanov
|
Enumeration of simple complete topological graphs
Jan
Kynčl
|
|
17:00-17:20
|
Bijective counting of plane bipolar orientations
Éric
Fusy, Dominique Poulalhon and Gilles Schaeffer
|
Regular chromatic number and the lonely runner
problem
Javier
Barajas Tomás and Oriol Serra
|
Folding and Spiralling: The Word View
Marcus
Schaefer, Eric Sedgwick and Daniel Štefankovič
|
