Satellite Thematic Session
There will be a Satellite
Thematic Session on Combinatorics at
the Sixth
European Congress of Mathematics in Kraków.
The session is planned for July 2 and 3 (afternoon), room 205, U2, at AGH University of Science and Technology.
A detailled programme is available here.
| 1. | Andrzej Dudek (Western Michigan University) | On restricted Ramsey numbers |
| 2. | Jarosław Grytczuk (Warsaw University of Technology) | Graph theoretic variations on Graham’s greatest common divisor problem |
| 3. | Andrzej Grzesik (Jagiellonian University) | Flag algebra calculus |
| 4. | Wilfried Imrich (Montanuniversität Leoben) | The endomorphism distinguishing number of graphs |
| 5. | Gyula O. H. Katona (Hungarian Academy of Sciences) | Forbidden intersection patterns in the familiesof subsets |
| 6. | Jakub Kozik (Jagiellonian University) | Entropy compression in graph coloring problems |
| 7. | Michał Lasoń (Jagiellonian University) | Splitting multidimensional necklace problem |
| 8. | Wojciech Lubawski (Polish Academy of Sciences) | Online list coloring of matroids |
| 9. | Grzegorz Matecki (Jagiellonian University) | Saks-West’s conjecture on semi-antichains and unichain coverings is FALSE |
| 10. | Katarzyna Mieczkowska (Adam Mickiewicz University) | On Erdos' extremal problem on matchings in hypergraphs |
| 11. | Oleg Pikhurko (University of Warwick, Carnegie Mellon University) | Quasirandom permutations are characterized by 4-point densities |
| 12. | Jakub Przybyło (AGH University of Science and Technology) | An application of Combinatorial Nullstellensatz within neighbour distinguishing edge colouring algorithms |
| 13. | Miloš Stojaković (University of Novi Sad) | Many collinear k-tuples with no k+1 collinear points |
| 14. | Mariusz Woźniak (AGH University of Science and Technology) | Edge colorings and the number of palettes |
| 15. | Günter M. Ziegler (Freie Universität Berlin) | Cutting polygons, and the permutahedron |
| 16. | Andrzej Żak (AGH University of Science and Technology) | Vertex stability via large induced subgraphs with bounded chromatic number |
For further information please contact:
Mariusz Woźniak