Organizers:
Sergio Cabello (University of Ljubljana, Slovenia)
Michael Drmota (TU Wien, Austria)
Jan Kratochvil (Charles University, Czech Republic)
Roman Nedela (Institute of Mathematics and Computer Science, Slovakia)
Oriol Serra (Universitat Politècnica de Catalunya, Catalunya)
Abstract:
The session is focused on combinatorics and graph theory including its
algebraic, algorithmic, geometric and probabilistic aspects.
Size: 4 time-slots.
List of speakers:
- Gwendal Collet (TU Wien, Austria)
Limit laws of vertex degree distribution in planar maps - Michal Drmota (TU Wien, Austria)
Subgraph Statistics in Subcritical Graph Classes - Jiří Fiala (Charles University, Czech Republic)
Scattering Number and Hamilton-Connectivity of Interval Graphs - Ilse Fischer (Universität Wien, Austria)
Extreme diagonally and antidiagonally symmetric alternating sign matrices of odd order - Gašper Fijavž (University of Ljubljana, Slovenia)
Minimal graphs containing $k$ perfect matchings - Bernard Gittenberger (TU Wien, Austria)
Asymptotic enumeration of unary-binary tree-like structures with restrictions on the unary height - Wilfried Imrich (Montanuniversität Leoben, Austria)
Efficient automorphism breaking in graphs - Matjaž Konvalinka (University of Ljubljana, Slovenia)
Enumeration and asymptotic properties of tanglegrams - Jan Kratochvil (Charles University, Czech Republic)
Partial Extensions and Simultaneous Embeddings - Florian Lehner (University of Hamburg, Germany)
The reconstruction problem for infinite graphs - Roman Nedela (Institute of Mathematics and Computer Science, Slovakia)
Automorphism Groups of Planar Graphs and Spherical Groups - Soňa Pavlíková (Slovak Technical University, Bratislava, Slovakia)
Integrally invertible graphs and their spectra - Daniël Paulusma (Durham University, UK)
Colouring diamond-free graphs - Edita Rollová (University of West Bohemia in Pilsen, Czech Republich)
Perfect matchings of regular bipartite graphs - Jiří Sgall (Computer Science Institute of Charles University, Czech Republic)
General Caching Is Hard: Even with Small Pages - Josef Siran (Slovak University of Technology in Bratislava, Slovakia)
Enumeration of orientably-regular maps on twisted linear fractional groups - Martin Skoviera (Univerzity Komenského, Bratislava, Slovakia)
Permutation snarks - Emma Yu Jin (TU Wien, Austria)
Graph limits of random graphs from a subset of connected partial $k$-trees