| Monday, Aug. 28 | ||
| 08:00 | Registration | |
| 09:15-10:00 FH1 |
Opening and Prize Ceremony | |
| 10:00-11:00 FH1 |
Irit Dinur High Dimensional Expanders, Agreement Tests, and PCPS |
|
| 11:00-11:30 | Coffee Break | |
| 11:30-12:20 | 2 short talks (4 rooms) | |
| 12:20-14:00 | Lunch break | |
| 14:00-15:00 FH1 |
Paul Wollan A New Look at the Structure of Graphs Excluding a Fixed Minor |
|
| 15:00-15:30 | Coffee Break | |
| 15:30-17:35 | 5 short talks (4 rooms) | |
| 19:00 | Reception at Rathaus (City Hall) | |
| Tuesday, Aug. 29 | ||
| 09:00-10:00 FH1 |
Lauren Williams Combinatorics of the Tree Amplituhedron |
|
| 10:00-10:30 | Coffee Break | |
| 10:30-12:10 | 4 short talks (4 rooms) | |
| 12:10-14:00 | Lunch break | |
| 14:00-15:00 FH1 |
Andrew Suk On the Erdős-Szekeres Convex Polygon Problem |
|
| 15:00-15:30 | Coffee Break | |
| 15:30-17:35 | 5 short talks (4 rooms) | |
| 17:40-18:00 | Business Meeting | |
| 19:00 | Piano Concert by Christian Krattenthaler (Kleiner Festsaal of the University of Vienna) |
|
| Wednesday, Aug. 30 | ||
| 09:00-10:00 FH1 |
Julia Chuzhoy Graph Routing Problems: Approximation, Hardness, and Graph-Theoretic Insights |
|
| 10:00-10:30 | Prize Lecture 1 (FH1) by Christian Reiher | |
| 10:30-11:00 | Prize Lecture 2 (FH1) by Maryna Viazovska | |
| 11:00-11:45 | Coffee Break | |
| 11:45-13:00 | 3 short talks (4 rooms) | |
| 13:00 | Lunch | |
| 14:45 | Touristic Vienna Tours | |
| Thursday, Aug. 31 | ||
| 09:00-10:00 FH1 |
Gerhard Wöginger The Combinatorics of Preference Profiles |
|
| 10:00-10:30 | Coffee Break | |
| 10:30-12:10 | 4 short talks (4 rooms) | |
| 12:10-14:00 | Lunch break | |
| 13:00-14:00 FH1 |
SageMath introduction tutorial by Viviane Pons | |
| 14:00-15:00 FH1 |
Guillaume Chapuy Voronoi Tessellations of Random Embedded Graphs |
|
| 15:00-15:30 | Coffee Break | |
| 15:30-17:10 | 4 short talks (4 rooms) | |
| 18:00 (Pickup time 17:20) |
Heurigen (conference dinner) | |
| Friday, Sept. 1 | ||
| 09:00-10:00 FH1 |
Yoshi Kohayakawa The Number of Bh-Sets and an Associated Extremal Problem for Random Sets of Integers |
|
| 10:00-10:30 | Coffee Break | |
| 10:30-12:10 | 4 short talks (4 rooms) | |
| 12:10-14:00 | Lunch break | |
| 14:00-15:00 FH1 |
Zoltan Füredi The extremal number for (a,b)-paths and other hypergraph trees |
|
| 15:00-15:30 | Coffee Break | |
| 15:30-17:10 | 4 short talks (4 rooms) | |
Short Lectures: 20 minutes talks + 5 minutes discussion
| Monday, Aug. 28, 11:30-12:20 | |||
| Room 1 (FH HS 1) Mo, 11:30-12:20 | |||
| Lifshitz and Nathan Keller. | The Junta Method in Extremal Hypergraph Theory and Chvátal’s Conjecture | ||
| Elad Aigner-Horev, David Conlon, Hiep Han, Yury Person and Mathias Schacht. | Quasirandomness in hypergraphs | ||
| Room 5 (FH HS 5) Mo, 11:30-12:20 | |||
| Natasha Morrison and Jonathan Noel. | Extremal Bounds for Bootstrap Percolation in the Hypercube | ||
| Andrzej Grzesik, Daniel Kral and Laszlo Miklos Lovasz. | Extremal graph theory and finite forcibility | ||
| Room 6 (FH HS 6) Mo, 11:30-12:20 | |||
| Matjaz Konvalinka. | A bijective proof of the hook-length formula for skew shapes | ||
| David Bevan, Robert Brignall, Andrew Elvey Price and Jay Pantone. | Staircases, dominoes, and the growth rate of 1324-avoiders | ||
| Room 8 (FH HS 8) Mo, 11:30-12:20 | |||
| Jaehoon Kim, Hong Liu, Maryam Sharifzadeh and Katherine Staden. | Proof of Koml\’os’s conjecture on Hamiltonian subsets | ||
| Josefran De Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer and Fabian Schulenburg. | Loose Hamiltonian cycles forced by large $(k-2)$-degree – sharp version | ||
| Monday, Aug. 28, 15:30-17:35 | |||
| Room 1 (FH HS 1) Mo, 15:30-17:35 | |||
| Elad Aigner-Horev and Hiep Han. | Linear quasi-rnadomness of subsets of Abelian groups and hypergraphs | ||
| Mykhaylo Tyomkyn. | Lagrangians of hypergraphs: The Frankl-F\”uredi conjecture holds almost everywhere | ||
| Nicolás Sanhueza Matamala, Allan Lo and Jie Han. | Covering and tiling hypergraphs with tight cycles | ||
| Beka Ergemlidze, Ervin Gyori and Abhishek Methuku. | 3-uniform hypergraphs without linear cycles | ||
| Dániel Grósz, Abhishek Methuku and Casey Tompkins. | Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs | ||
| Room 5 (FH HS 5) Mo, 15:30-17:35 | |||
| Nina Kamcev, Tomasz Łuczak and Benny Sudakov. | Anagram-free colorings of graphs | ||
| Sebastián Bustamante, Hiệp Hàn and Maya Stein. | Almost partitioning 2-edge-colourings of 3-uniform hypegraphs with two monochromatic tight cycles | ||
| Pilar Cano, Guillem Perarnau and Oriol Serra. | Rainbow spanning subgraphs in bounded edge–colorings of graphs with large minimum degree | ||
| Jasine Babu, Manu Basavaraju, L. Sunil Chandran and Mathew Francis. | On Induced Colourful Paths in Triangle-free Graphs | ||
| Tien-Nam Le, Ararat Harutyunyan, Stephan Thomasse and Alantha Newman. | Coloring dense digraphs | ||
| Room 6 (FH HS 6) Mo, 15:30-17:35 | |||
| Julien Courtiel, Éric Fusy, Mathias Lepoutre and Marni Mishna. | Bijections for walks ending on an axis, using open arc diagrams | ||
| Manuel Kauers and Ronghua Wang. | Lattice Walks in the Octant with Infinite Associated Groups | ||
| Rika Yatchak. | Automated Positive Part Extraction for Lattice Path Generating Functions in the Octant | ||
| Marc Noy, Clément Requilé and Juanjo Rué. | Enumeration of labeled 4-regular planar graphs | ||
| Ishay Haviv and Dan Levy. | Symmetric Complete Sum-free Sets in Cyclic Groups | ||
| Room 8 (FH HS 8) Mo, 15:30-17:35 | |||
| Amir-Hossein Bateni, Thibault Manneville and Vincent Pilaud. | On quadrangulations and Stokes posets | ||
| Istvan Tomon, Vytautas Gruslys and Imre Leader. | Tiling the Boolean lattice with copies of a poset | ||
| William T. Trotter and Bartosz Walczak. | Boolean dimension and local dimension | ||
| Henri Mühle. | Two Posets of Noncrossing Partitions | ||
| Boram Park and Seonjeong Park. | Shellable posets arisen from the even subgraphs of a multigraph | ||
| Tuesday, Aug. 29, 10:30-12:10 | |||
| Room 1 (FH HS 1) Tue, 10:30-12:10 | |||
| Matija Bucic, Shoham Letzter and Benny Sudakov. | Monochromatic paths in random tournaments | ||
| Matija Bucic, Shoham Letzter and Benjamin Sudakov. | Directed Ramsey number for trees | ||
| Mihyun Kang, Tamas Makai and Oleg Pikhurko. | Supersaturation Problem for the Bowtie | ||
| Hong Liu, Oleg Pikhurko and Katherine Staden. | The minimum number of triangles in graphs of given order and size | ||
| Room 5 (FH HS 5) Tue, 10:30-12:10 | |||
| Ervin Gyori and Balazs Keszegh. | On the number of edge-disjoint triangles in K4-free graphs | ||
| Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le and Stéphan Thomassé. | Additive bases and flows in graphs | ||
| Peter Frankl and Andrey Kupavskii. | Families with no matchings of size $s$ | ||
| cancelled | Vadim Lozin and Victor Zamaraev. | The structure and the number of $P_7$-free bipartite graphs | |
| Room 6 (FH HS 6) Tue, 10:30-12:10 | |||
| Alexandr Polyanskii. | Pairwise intersecting homothets of a convex body | ||
| Oscar Iglesias-Valiño and Francisco Santos. | Classification of empty lattice 4-simplices | ||
| Vladimir Bondarenko and Andrei Nikolaev. | Some properties of the skeleton of the pyramidal tours polytope | ||
| Malte Milatz. | Directed Random Walks on Polytopes with Few Facets | ||
| Room 8 (FH HS 8) Tue, 10:30-12:10 | |||
| Julia Böttcher, Richard Montgomery, Olaf Parczyk and Yury Person. | Embedding spanning bounded degree subgraphs in randomly perturbed graphs | ||
| Yoshiharu Kohayakawa, Guilherme O. Mota and Mathias Schacht. | Monochromatic trees in random graphs | ||
| Mihyun Kang, Michael Mosshammer and Philipp Sprüssel. | Evolution of the giant component in graphs on orientable surfaces | ||
| Zoltan Furedi and Ida Kantor. | Kneser ranks of random graphs and minimum difference representations | ||
| Tuesday, Aug. 29, 15:30-17:35 | |||
| Room 1 (FH HS 1) Tue, 15:30-17:35 | |||
| Lale Özkahya and Yury Person. | Minimum rainbow H-decompositions of graphs | ||
| Wanchote Jiamjitrak and Erik Jan van Leeuwen. | Co-Bipartite Neighborhood Edge Elimination Orderings | ||
| Wouter Cames van Batenburg and Ross Kang. | Packing two graphs of even girth 10 | ||
| Ross J. Kang and François Pirot. | Distance colouring without one cycle length | ||
| Zoltán Lóránt Nagy. | Generalizing Erdős, Moon and Moser’s result — The number of $k$-dominating independent sets | ||
| Room 5 (FH HS 5) Tue, 15:30-17:35 | |||
| Rémi de Joannis de Verclos, Ross J. Kang and Lucas Pastor. | Colouring squares of claw-free graphs | ||
| Shinya Fujita, Ruonan Li and Guanghui Wang. | Decomposing edge-colored graphs under color degree constraints | ||
| Lucas Oliveira Contiero, Carlos Hoppen, Hanno Lefmann and Knut Odermann. | Stability of extremal hypergraphs with applications to an edge-coloring problem | ||
| Dmitry Shabanov and Margarita Akhmejanova. | Colorings of b-simple hypergraphs | ||
| Diana Piguet and Maria Saumell. | A median-type condition for graph tiling | ||
| Room 6 (FH HS 6) Tue, 15:30-17:35 | |||
| Viresh Patel and Guus Regts. | Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials | ||
| Behrooz Bagheri Gh., Herbert Fleischner, Cun-Quan Zhang and Zhang Zhang. | Compatible Cycle Decomposition of bad K_5-minor free graphs | ||
| Alexey Pokrovskiy and Benny Sudakov. | Edge-disjoint rainbow trees in properly complete graphs | ||
| Peter Allen, Julia Böttcher, Jan Hladky and Diana Piguet. | Packing degenerate graphs greedily | ||
| Tereza Klimošová and Stéphan Thomassé. | Decomposing graphs into paths and trees | ||
| Room 8 (FH HS 8) Tue, 15:30-17:35 | |||
| Carlos Hoppen, Richard Lang, Hanno Lefmann, Yoshiharu Kohayakawa and Henrique Stagni. | Estimating the distance to a hereditary graph property | ||
| Maurício Collares, Yoshiharu Kohayakawa, Robert Morris and Guilherme O. Mota. | On the number of r-transitive orientations of G(n,p) | ||
| Oliver Cooley, Penny Haxell, Mihyun Kang and Philipp Sprüssel. | Homological connectedness of random hypergraphs | ||
| Dmitry Shabanov, Dmitry Kravtsov and Nikolay Krokhmal. | Panchromatic 3-coloring of a random hypergraph | ||
| Steven Chaplick and Peter Zeman. | Combinatorial Problems on $H$-graphs | ||
| Wednesday, Aug. 30, 11:30-12:45 | |||
| Room 1 (FH HS 1) Wed, 11:30-12:45 | |||
| Michelle Delcourt and Luke Postle. | On the List Coloring Version of Reed’s Conjecture | ||
| Tom Kelly and Luke Postle. | Toward a Local Epsilon Version of Reeds Conjecture | ||
| Jacob Fox and Fan Wei. | On the Local Approach to Sidorenko Conjecture | ||
| Room 5 (FH HS 5) Wed, 11:30-12:45 | |||
| Viresh Patel, Allan Lo, Jozef Skokan and John Talbot. | Decomposing Tournaments into Paths | ||
| Stéphane Bessy and Jocelyn Thiebaut. | Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture | ||
| Tereza Klimošová, Diana Piguet and Václav Rozhoň. | A skew version of the Loebl-Komlós-Sós conjecture | ||
| Room 6 (FH HS 6) Wed, 11:30-12:45 | |||
| Afonso Bandeira, Asaf Ferber and Matthew Kwan. | Resilience for the littlewood-offord problem | ||
| Torsten Mütze, Christoph Standke and Veit Wiechert. | A minimum-change version of the Chung-Feller theorem for Dyck paths | ||
| Andrei Asinowski, Gill Barequet and Yufei Zheng. | Enumerating Polyominoes with Fixed Perimeter Defect | ||
| Room 8 (FH HS 8) Wed, 11:30-12:45 | |||
| Christopher Kusch, Juanjo Rué, Christoph Spiegel and Tibor Szabó. | Random Strategies are Nearly Optimal for Generalized van der Waerden Games | ||
| Octavio Zapata, Anuj Dawar and Simone Severini. | Pebble Games and Cospectral Graphs | ||
| Mirjana Mikalački and Miloš Stojaković. | Winning fast in biased Maker-Breaker games | ||
| 14:45 | Touristic Vienna Tours | ||
| Thursday, Aug. 31, 10:30-12:10 | |||
| Room 1 (FH HS 1) Thu, 10:30-12:10 | |||
| Ewan Davies, Matthew Jenssen, Will Perkins and Barnaby Roberts. | Tight bounds on the coefficients of partition functions via stability | ||
| Dániel Grósz, Abhishek Methuku and Casey Tompkins. | On subgraphs of $C_{2k}$-free graphs | ||
| Beka Ergemlidze, Ervin Gyori, Abhishek Methuku and Nika Salia. | Maximum number of triangles in a C_5-free graph | ||
| Hojin Choi, O-Joung Kwon, Sang-Il Oum and Paul Wollan. | Chi-boundedness of graph classes excluding wheel vertex-minors | ||
| Room 5 (FH HS 5) Thu, 10:30-12:10 | |||
| Nora Frankl, Andrey Kupavskii and Konrad Swanepoel. | Embedding graphs in Euclidean space | ||
| Zdeněk Dvořák, Bojan Mohar and Robert Samal. | Exponentially many nowhere-zero $Z_3$-, $Z_4$-, and $Z_6$-flows | ||
| cancelled | Vadim Levit and Eugen Mandrescu. | W2-graphs and shedding vertices | |
| Fábio Botler and Alexandre Talon. | Decomposition of 8-regular graphs into paths of length 4 | ||
| Room 6 (FH HS 6) Thu, 10:30-12:10 | |||
| Igor Balla and Benny Sudakov. | Equiangular lines and subspaces in Euclidean spaces | ||
| Tamás Mészáros and Lajos Rónyai. | Standard monomials and extremal vector systems | ||
| Jose Capco, Matteo Gallet, Georg Grasegger, Christoph Koutschan, Niels Lubbes and Josef Schicho. | Computing the number of realizations of a Laman graph | ||
| Jiří Fiala, Jan Hubička and Yangjing Long. | Gaps in full homomorphism order | ||
| Room 8 (FH HS 8) Thu, 10:30-12:10 | |||
| Shuya Chiba. | On the difference between hamilton cycles and 2-factors with a prescribed number of cycles | ||
| Katarzyna Rybarczyk. | Hamilton cycles in the line graph of a random graph | ||
| Carlos Hoppen, Roberto Freitas Parente and Cristiane Sato. | Packing arborescences in random digraphs | ||
| Zdenek Dvorak and Jakub Pekarek. | Irreducible 4-critical triangle-free toroidal graphs | ||
| Thursday, Aug. 31, 15:30-17:10 | |||
| Room 1 (FH HS 1) Thu, 15:30-17:10 | |||
| Dániel Korándi, Gábor Tardos, István Tomon and Craig Weidert. | On the Turán number of ordered forests | ||
| Martin Balko, Jan Kynčl, Stefan Langerman and Alexander Pilz. | Induced Ramsey-type results and binary predicates for point sets | ||
| Jan Corsten. | Grid Ramsey problem | ||
| Jan Hubička and Jaroslav Nešetřil. | Ramsey theorem for designs | ||
| Room 5 (FH HS 5) Thu, 15:30-17:10 | |||
| Victor Falgas-Ravry, Oleg Pikhurko and Jan Volec. | The codegree threshold of $K_4^-$ | ||
| Henning Bruhn and Matthias Heinlein. | K_4-expansions have the edge-Erdős-Pósa-property | ||
| Martin Doležal, Jan Hladky, Ping Hu and Diana Piguet. | First steps in combinatorial optimization on graphons: Matchings | ||
| Dan Hefetz and Mykhaylo Tyomkyn. | On the inducibility of cycles | ||
| Room 6 (FH HS 6) Thu, 15:30-17:10 | |||
| Joshua Lockhart, Otfried Guehne and Simone Severini. | Combinatorial entanglement | ||
| Michał Dębski, Jarosław Grytczuk, Urszula Pastwa, Barbara Pilat, Joanna Sokół, Michał Tuczyński, Przemysław Wenus and Krzysztof Węsek. | On avoding $r$-repetitions in $\mathbb{R}^2$ | ||
| Herman Chen, Sergey Kitaev, Torsten Mütze and Brian Sun. | On universal partial words | ||
| Alina Mayorova and Ekaterina Vassilieva. | On the structure constants of the descent algebra of the hyperoctahedral group | ||
| Room 8 (FH HS 8) Thu, 15:30-17:10 | |||
| Mikael Hansson and Axel Hultman. | A word property for twisted involutions in Coxeter groups | ||
| Cesar Ceballos, Arnau Padrol and Camilo Sarmiento. | v-Tamari lattices via subword complexes | ||
| Vincent Pilaud and Viviane Pons. | Permutrees | ||
| Daniel Gonçalves and Mathew Francis. | Duschnik-Miller dimension of contact systems of d-dimensional boxes | ||
| Friday, Sept. 1, 10:30-12:10 | |||
| Room 1 (FH HS 1) Fri, 10:30-12:10 | |||
| Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter and Veit Wiechert. | Burling graphs, chromatic number, and orthogonal tree-decompositions | ||
| Tamás Király and Zsuzsa Mészáros-Karkus. | Finding strongly popular b-matchings in bipartite graphs | ||
| Tomáš Dvořák, Jirka Fink, Petr Gregor and Tomáš Novotný. | Towards a problem of Ruskey and Savage on matching extendability | ||
| Archontia Giannopoulou, Stephan Kreutzer and Sebastian Wiederrecht. | Matching Connectivity: On the Structure of Graphs with Perfect Matchings | ||
| Room 5 (FH HS 5) Fri, 10:30-12:10 | |||
| Marthe Bonamy and Kitty Meeks. | The Interactive Sum Choice Number of Graphs | ||
| Liudmila Ostroumova Prokhorenkova, Pawel Pralat and Andrei Raigorodskii. | Modularity in several random graph models | ||
| Arseniy Sagdeev. | On a Frankl-Rodl theorem and its geometric corollaries | ||
| Mikhail Tikhomirov. | On complexity of multidistance graph recognition in R^1 | ||
| Room 6 (FH HS 6) Fri, 10:30-12:10 | |||
| Immanuel Albrecht. | On Finding Some New Excluded Minors For Gammoids | ||
| Ajit Diwan, Bodhayan Roy and Subir Ghosh. | Two Layer Drawings of Bipartite Graphs | ||
| Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubička, Miltiadis Karamanlis, Michael Kompatscher, Matěj Konečný and Micheal Pawliuk. | Completing graphs to metric spaces | ||
| Diego Nicodemos and Matej Stehlik. | Odd cycles in cubic plane graphs. Packing and covering odd cycles in cubic plane graphs with small faces | ||
| Room 8 (FH HS 8) Fri, 10:30-12:10 | |||
| Borut Lužar, Martina Mockovčiaková and Roman Soták. | On a star chromatic index of subcubic graphs | ||
| Radek Hušek and Robert Šámal. | Homomorphisms of Cayley graphs and Cycle Double Covers | ||
| Vladimir Gusev, Raphaël Jungers and Elena Pribavkina. | Generalized primitivity of labeled digraphs | ||
| Stefan Felsner, Hendrik Schrezenmaier and Raphael Steiner. | Pentagon contact representations | ||
| Friday, Sept 1, 15:30-17:10 | |||
| Room 1 (FH HS 1) Fri, 15:30-17:10 | |||
| Guillaume Ducoffe and David Coudert. | A simple approach for lower-bounding the distortion in any Hyperbolic embedding | ||
| Clemens Huemer, Alexander Pilz, Carlos Seara and Rodrigo I. Silveira. | Characteristic polynomials of production matrices for geometric graphs | ||
| Israel Rocha. | Spectral Bisection with Two Eigenvectors | ||
| Konrad Kazimierz Dabrowski and Daniel Paulusma. | Contracting Bipartite Graphs to Paths and Cycles | ||
| Room 5 (FH HS 5) Fri, 15:30-17:10 | |||
| Guus Regts and Bart Sevenster. | Graph parameters from invariants of the orthosymplectic group | ||
| Bart Litjens, Andrew Goodall, Guus Regts and Lluís Vena. | A Tutte polynomial for non-orientable maps | ||
| Seongmin Ok and Thomas Perrett. | Density of Real Zeros of the Tutte Polynomial | ||
| Tomoki Nakamigawa and Tadashi Sakuma. | The Expansion of a Chord Diagram and the Tutte Polynomial | ||
| Room 6 (FH HS 6) Fri, 15:30-17:10 | |||
| Michelle Delcourt and Luke Postle. | On Star Decompositions of Random Regular Graphs | ||
| Winfried Hochstättler and Michael Wilhelmi. | Sticky matroids and Kantor’s Conjecture | ||
| Aharoni Ron, Eli Berger, Daniel Kotlar and Ran Ziv. | Fair representation in dimatroids | ||
| Quentin Fortier, Csaba Király, Zoltán Szigeti and Shin-Ichi Tanigawa. | On packing spanning arborescences with matroid constraint | ||
| Room 8 (FH HS 8) Fri, 15:30-17:10 | |||
| Gwendal Collet, Elie De Panafieu, Danièle Gardy, Bernhard Gittenberger and Vlady Ravelomanana. | Threshold functions for small subgraphs: an analytic approach | ||
| Eugenijus Manstavicius. | When do combinatorial structures obey the Poisson-Dirichlet law? | ||
| Ljuben Mutafchiev. | An Asymptotic Scheme for Analysis of Expectations of Plane Partition Statistics | ||
| Chris Dowden, Mihyun Kang and Philipp Sprussel. | The evolution of random graphs on surfaces | ||