| Monday, July 17 | ||
|---|---|---|
| 9:00 | ||
| 9:45 |
Graham, R.
Old and new problems and results in Ramsey theory |
|
| coffee break | ||
| 11:00 |
Toft, B.
Contraction-double-critical graphs |
Morris, R.
Bootstrap percolation in [n]d |
| 11:25 |
Csaba, B.
Approximate multipartite version of the Hajnal-Szemeredi Theorem |
Szabó, T.
Turán's Theorem in the hypercube |
| 11:50 |
Liu, H.
Highly connected subgraphs in multicoloured graphs |
Bona, M.
On some surprisingly high probabilities concerning compositions of integers. |
| lunch break | ||
| 14:00 |
Schrijver, L.
Graph algebras and invariants |
|
| 14:45 |
Stojakovic, M.
The games of planarity and k-colorability |
Recski, A.
Combinatorial conditions for the rigidity of tensegrity frameworks |
| 15:10 |
Bartnicki, T.
The game chromatic index of graphs |
Kempner, Y
Algorithmic and polyhedral characterization of poly-antimatroids |
| coffee break | ||
| 16:05 |
Niwczyk, S.
Weight choosability of graphs |
Schmitt, J.
On a Relationship of Two Extremal Functions |
| 16:30 |
Berke, R.
Relaxed Two-Coloring of Cubic Graphs |
Kun, G.
A concept of expander relational structures and an application |
| 16:55 |
Barát, J.
Claw decompositions and orientations of graphs |
Chernov, A.
On a probabilistic aspect of Grunbaum's problem |
| 17:20 |
Pluhár, A.
On diameter games |
Vallentin, F.
New Upper Bounds for Kissing Numbers |