SUNDAY | September 15 |
18:30 – 21:30 | dinner |
| |
MONDAY | September 16 |
8:00 – 9:00 | breakfast |
9:10 | Official Opening of the Conference |
9:15 – 10:10 | Alex Scott, Recent work on the Erdős-Hajnal Conjecture |
10:15 – 11:10 | Marthe Bonamy, Around the Four Colour Theorem |
11:10 – 11:40 | coffee break |
11:40 – 13:15 | contributed talks |
| session A |
11:40 – 12:00 | Tomáš Masařík, Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P4 |
12:05 – 12:25 | Jędrzej Hodor, Weak coloring numbers of minor-closed graph classes |
12:30 – 12:50 | Ugo Giocanti, Coarse geometry of quasi-transitive graphs |
12:55 – 13:15 | Piotr Micek, Planar graphs in blowups of fans |
| session B |
11:40 – 12:00 | —– |
12:05 – 12:25 | Simona Boyadzhiyska, Simultaneous colourings of graphs |
12:30 – 12:50 | Mateusz Kamyczura, Conflict-free edge colorings of nearly regular graphs |
12:55 – 13:15 | Paweł Pękała, List variants of majority edge-colourings of graphs |
| session C |
11:40 – 12:00 | Sarosh Adenwalla, Avoiding Arithmetic Progressions in Permutations of the Integers |
12:05 – 12:25 | Tomasz Kościuszko, Sets with no solutions to some symmetric linear equations |
12:30 – 12:50 | Sylwia Cichacz, Disjoint zero-sum sets in Abelian groups |
12:55 – 13:15 | Magdalena Prorok, Rainbow Turan problem |
13:15 | lunch |
15:00 – 15:55 | Peter Keevash, Isoperimetric stability and its applications |
15:55 – 16:25 | coffee break |
16:25 | Open Mind Award Ceremony |
16:35 – 18:15 | nominees’ talks alphabetically |
16:35 – 17:05 | Bartłomiej Dudek, Finding the Common Core of Some Combinatorial Problems |
17:10 – 17:40 | Borys Kuca, The Szemerédi theorem and beyond |
17:45 – 18:15 | Marek Sokołowski, Combinatorics of Graphs of Bounded Twin-Width |
19:00 | welcome party |
| |
TUESDAY | September 17 |
8:00 – 9:00 | breakfast |
9:15 – 13:00 | Tutorial I: Daniel Neuen, The Weisfeiler-Leman algorithm |
9:15 – 10:15 | tutorial part 1 |
10:15 – 10:45 | coffee break |
10:45 – 11:45 | tutorial part 2 |
12:00 – 13:00 | tutorial part 3 |
13:15 | lunch |
15:00 – 15:55 | Rob Morris, Geometric conjectures and Ramsey numbers |
15:55 – 16:25 | coffee break |
16:25 – 18:00 | contributed talks |
| session A |
16:25 – 16:45 | Patryk Morawski, Oriented Ramsey Numbers of Bounded Degree Digraphs |
16:50 – 17:10 | Andrzej Dudek, The generalized Ramsey number f(n, 5, 8) = 6/7 n + o(n) |
17:15 – 17:35 | Eden Kuperwasser, On the Kohayakawa–Kreuter conjecture |
17:40 – 18:00 | Arsenii Sagdeev, Canonical theorems in Euclidean Ramsey theory |
| session B |
16:25 – 16:45 | Sebastian Czerwiński, The Graham–Pollak theorem for bipartite graphs |
16:50 – 17:10 | Nadzieja Hodur, On 3-colourability of (bull, H)-free graphs |
17:15 – 17:35 | Igor Grzelec, On some conjectures about local irregularity of graphs |
17:40 – 18:00 | Tomasz Krawczyk, Forbidden induced subgraphs for (Helly) circular-arc graphs |
| session C |
16:25 – 16:45 | Anna Flaszczyńska, Distinguishing vertices of graphs by sequences |
16:50 – 17:10 | Aleksandra Gorzkowska, Arc-distinguishing of orientations of graphs |
17:15 – 17:35 | Jakub Kwaśny, Distinguishing regular graphs |
17:40 – 18:00 | Rafał Kalinowski, Unfriendly Partition Conjecture holds for line graphs |
18:30 | dinner |
| |
WEDNESDAY | September 18 |
8:00 – 9:00 | breakfast |
9:00 – 12:35 | Tutorial II: Felix Joos, Hypergraph matchings |
9:00 – 10:00 | tutorial part 1 |
10:00 – 10:25 | coffee break |
10:25 – 11:25 | tutorial part 2 |
11:35 – 12:35 | tutorial part 3 |
12:45 | lunch |
13:45 – 21:00 | excursion |
18:30 | dinner |
| |
THURSDAY | September 19 |
8:00 – 9:00 | breakfast |
9:15 – 10:10 | Julia Böttcher, Graph universality |
10:15 – 11:10 | Catherine Greenhill, Asymptotic enumeration, hypergraphs and directed hypergraphs |
11:10 – 11:40 | coffee break |
11:40 – 13:15 | contributed talks |
| session A |
11:40 – 12:00 | Mirjana Mikalački, The burning game |
12:05 – 12:25 | Natalia Adamska, Lower bounds for online Ramsey numbers for paths |
12:30 – 12:50 | Mateusz Litka, Online size Ramsey number for C4 and P6 |
12:55 – 13:15 | Przemysław Gordinowicz, From binary search through games to graphs |
| session B |
11:40 – 12:00 | Marta Piecyk, Homomorphisms of bounded–diameter graphs |
12:05 – 12:25 | Gaurav Kucheriya, Orientations of graphs with at most one directed path |
12:30 – 12:50 | Hubert Grochowski, Approximation algorithms for L(2,1)-labeling of unit disk graphs |
12:55 – 13:15 | Miloš Stojaković, Moving and stacking squares for greater visibility |
| session C |
11:40 – 12:00 | Jialu Zhu, Minimum non-chromatic-choosable graphs with given chromatic number |
12:05 – 12:25 | Yangyan Gu, The Alon-Tarsi number of planar graphs revisited |
12:30 – 12:50 | Huan Zhou, The Alon-Tarsi number of planar graphs with girth 5 and locally planar graphs |
12:55 – 13:15 | Hoang La, Fractional domatic number and minimum degree |
13:15 | lunch |
15:00 – 15:55 | Tomasz Łuczak, Cycles in Ramsey theory |
15:55 – 16:25 | coffee break |
16:25 – 18:25 | contributed talks |
| session A |
16:25 – 16:45 | Matas Šileikis, Maximum local tree counts in the random binomial graph |
16:50 – 17:10 | Asaf Cohen Antonir, On the Upper Tail Problem for irregular graphs |
17:15 – 17:35 | Anna M. Limbach, Graphon branching processes and fractional isomorphism |
17:40 – 18:00 | Rui-Ray Zhang, Residual entropy and Eulerian orientations of graphs and random graphs with given degrees |
18:05 – 18:25 | Mindaugas Bloznelis, Sparse and clustered stationary temporal networks |
| session B |
16:25 – 16:45 | Ignacy Buczek, Balanced partitions of K4-free graphs |
16:50 – 17:10 | Richard Lang, A hypergraph bandwidth theorem |
17:15 – 17:35 | Danila Cherkashin, On set systems without singleton intersections |
17:40 – 18:00 | Julia Kozik, Integrity of grids |
18:05 – 18:25 | Konstanty Junosza-Szaniawski, Partial packing coloring of a triangular-square grid |
| session C |
16:25 – 16:45 | Giovanne Santos, Antidirected trees in directed graphs |
16:50 – 17:10 | Andrzej Grzesik, Subgraphs with a large minimum semidegree |
17:15 – 17:35 | Justyna Jaworska, Generalized Turán problem for directed cycles |
17:40 – 18:00 | Pedro Araújo, Semidegree threshold for spanning trees in oriented graphs |
18:05 – 18:25 | Clément Legrand-Duchesne, A recoloring version of a conjecture of Reed |
19:00 | barbecue |
| |
FRIDAY | September 20 |
8:00 – 9:00 | breakfast |
9:15 – 10:10 | Jacob Fox, Independence in Random Graph Models |
10:15 – 11:10 | Maciej Dołęga, Overview of map enumeration |
11:10 – 11:40 | coffee break |
11:40 – 13:15 | contributed talks |
| session A |
11:40 – 12:00 | Ilay Hoshen, Stability of large cuts in random graphs |
12:05 – 12:25 | Mehmet Akif Yildiz, Path Decompositions of Oriented Graphs |
12:30 – 12:50 | Wojciech Michalczuk, Normal approximation for subgraph count in random hypergraphs |
12:55 – 13:15 | Grzegorz Serafin, Small subgraphs count in random intersection graph |
| session B |
11:40 – 12:00 | Bogdana Oliynyk, The unitary Cayley graph of upper triangular matrix rings |
12:05 – 12:25 | Marek Skrzypczyk, Qudratic embedding of graphs |
12:30 – 12:50 | Bartłomiej Bychawski, Characterizations of unstable circulant graphs |
12:55 – 13:15 | Sandeep Kumar, On the Index of Tricyclic Signed Graphs |
| session C |
11:40 – 12:00 | Andrzej Żak, Coloring the Input of a Knapsack Problem |
12:05 – 12:25 | Mariusz Meszka, Two-factorizations of some regular graphs |
12:30 – 12:50 | Aleksander Katan, Majority colorings of countable DAGs |
12:55 – 13:15 | Marcin Stawiski, Distinguishing graphs by list edge colourings |
13:15 | lunch |
15:00 – 15:55 | József Balogh, Turán density of long tight cycle minus one hyperedge |
15:55 – 16:25 | coffee break |
16:25-18:00 | contributed talks |
| session A |
16:25 – 16:45 | Xuding Zhu, Indicated list colouring of graphs |
16:50 – 17:10 | Bartosz Walczak, Coloring graphs with an excluded Burling graph |
17:15 – 17:35 | John Sylvester, Recent Progress on Adjacency Labelling Schemes |
17:40 – 18:00 | William T. Trotter, The class of posets with planar cover graphs is dim-bounded |
18:30 | dinner |
| |
SATURDAY | September 21 |
8:00 – 9:00 | breakfast |
| bus to Poznań |
| |