Book of abstracts

Monday, September 21

7:30–9:00	Breakfast
9:10	Official Opening of the Conference
9:15–10:05	Michael Krivelevich On the unreasonable effectiveness of vertex sampling in graph theoretic problems Tel Aviv University
	Session A	Session B	Session C	Session D
10:15–10:35	Andrzej Grzesik Making a K₄-free graph balanced bipartite Jagiellonian University	Tomasz Krawczyk Characterizing circular-arc graphs by minimal forbidden induced subgraphs Warsaw University of Technology	Rafał Kalinowski Strong majority colourings of graphs AGH University	Anna Flaszczyńska Local irregularity of k-multigraphs AGH University
10:40–11:00	Magdalena Prorok The Turán number for cycles of lengths congruent to 0 and 2 mod k AGH University	Michał Lasoń Arboricity Nearly Bounds Degeneracy IMPAN	Paweł Pękała On-line majority edge-colourings of graphs AGH University	Igor Grzelec Locally irregular total coloring and strong locally irregular total coloring of graphs AGH University
11:00–11:30	Coffee break
11:30–11:50	Balázs Keszegh Saturation of oriented graphs Alfréd Rényi Institute of Mathematics and ELTE	Paweł Rafał Bieliński MWIS in hereditary classes of ordered graphs Warsaw University of Technology	Magda Dettlaff Majority C-coloring of graphs University of Gdańsk	Nadzieja Hodur Distinguishing index of K_{1,s}-free graphs – new results and generalizations AGH University
11:55–12:15	Bartłomiej Kielak Solution of uniform Turán’s Tetrahedron Problem Leipzig University	Wojciech Gabryelski Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs Wrocław University of Science and Technology	Mateusz Kamyczura Conflict-free chromatic index AGH University	Jakub Kwaśny On the sequence variant of the 1-2-3 conjecture AGH University
12:20–12:40	Máté Vizer The uniform (p,q)-extremal problem for large n Budapest University of Technology and Economics		Sebastian Czerwiński Packing-list coloring of graphs University of Zielona Góra	Barbara Stołowska Total magic labellings AGH University
13:00	Lunch
14:45–15:35	Vida Dujmović Space universal graphs for minor-closed families University of Ottawa
15:35–16:15	Poster Session
16:15–16:45	Coffee break
16:45	Open Mind Award Ceremony
16:50–18:30	Nominees’ talks alphabetically
16:50–17:20	Tomasz Kościuszko Extremal behaviour of linear equations Adam Mickiewicz University
17:25–17:55	Marta Piecyk Faster algorithms on subclasses of ordered graphs CISPA Helmholtz Center for Information Security
18:00–18:30	Michał Seweryn Polynomial bounds for the Graph Minor Structure Theorem Jagiellonian University
19:00	Welcome party

Tuesday, September 22

7:30–9:00	Breakfast
9:10–9:50	Tutorial I: Andrzej Grzesik An Introduction to Flag Algebras Jagiellonian University Part 1
10:00–10:40	Part 2
10:40–11:20	Coffee break
11:20–12:00	Part 3
12:05–12:45	Part 4
13:00	Lunch
14:45–15:35	Hamed Hatami A characterization of idempotent Schur multipliers McGill University
	Session A	Session B	Session C	Session D
15:45–16:05	Jan Petr Distributive sublattices of Bruhat orders: the Harris-Kleitman inequality for finite Coxeter groups University of Passau	Dingyuan Liu Turán problems for simplicial complexes Karlsruhe Institute of Technology	Hubert Grochowski Computational and probabilistic aspects of the shortest path under attacks game Warsaw University of Technology	Mariusz Grech Wreath products and automorphism groups of edge-colored graphs Wrocław University of Science and Technology
16:10–16:30	Recep Altar Induced poset saturation in the hypergrid Umea University	Nika Salia Triangles vs pentagons, and Berge cycles Jagiellonian University	Grzegorz Gutowski Graph division games Jagiellonian University	Agata Żywot Graphical complexity of direct products of permutation groups Wrocław University of Science and Technology
16:30	Conference photo – in front of the Palace
16:30–17:00	Coffee break
17:00–17:20	Frederik Garbe Universally spectral and trace positive matrix words Czech Academy of Sciences	Sarosh Adenwalla Boolean combinations of graph classes University of Liverpool	Konstanty Junosza-Szaniawski Coloring mixed graphs Warsaw University of Technology	Florian Lehner Groups acting on trees and tree-like graphs University of Auckland
17:25–17:45	Harry Sapranidis Mantelos A cycle-based characterization of determinantal equivalence The Hebrew University of Jerusalem		Hoang La Graph reconstruction via subgraph queries Université Paris-Saclay	Bogdana Oliynyk The Cayley graph of a quandle Silesian University of Technology
17:50–18:10	Mamta Verma Bounds for the spread of graph matrices Dr. B. R. Ambedkar National Institute of Technology Jalandhar		Filip Jasionowicz Finding induced detours in linear time on interval and circular-arc graphs University of Oxford	Jasmin Katz Zero-sum Ramsey numbers of bounded degree graphs London School of Economics
18:30	Dinner

Wednesday, September 23

7:30–9:00	Breakfast
9:10–9:50	Tutorial II: Agelos Georgakopoulos Coarse Graph Theory University of Warwick Part 1
10:00–10:40	Part 2
10:40–11:20	Coffee break
11:20–12:00	Part 3
12:05–12:45	Part 4
12:45	Lunch
14:00	Excursion — Wielkopolski Park Narodowy
14:30	Excursion — Poznań – Brama Poznania
16:00–16:30	Coffee break — for those who stayed in Będlewo
18:30	Dinner

Thursday, September 24

7:30–9:00	Breakfast
9:10–10:00	Zsolt Tuza Anti–Ramsey Theory University of Pannonia
	Session A	Session B	Session C	Session D
10:15–10:35	Demetres Christofides Diameter thresholds of random Cayley graphs InSPIRE Research Center	Brian Hearn Spanning tight components in 4-uniform hypergraphs London School of Economics	Bartłomiej Bychawski & Ivan Spyrydonov Quantitative bounds in the Polynomial Szemerédi Theorem for configuration x, x+y, x+2y, x+y³ Jagiellonian University	Maciej Cisiński Further progress on Wojda’s conjecture AGH University
10:40–11:00	Cezary Dudkiewicz Asymptotic normality of the giant component in random intersection graphs Adam Mickiewicz University, Poznań	Adam Krupowies Ramsey numbers of family P₃ Adam Mickiewicz University, Poznań	Anna Margarethe Limbach On Khovanskii’s Theorem and its application to the Erdős multiplication table problem Charles University	Andrzej Żak Near-packings of graphs with bounded-degree overlap AGH University
11:00–11:30	Coffee break
11:30–11:50	Wojciech Michalczuk Normal approximation for subgraph count in graphon-based random graphs Wrocław University of Science and Technology	Andrew Lane On the factorization of Dirac hypergraphs University of Passau	Bartosz Sobolewski Monochromatic arithmetic progressions in binary automatic words Jagiellonian University	Juliana Palmen On 2-factorizations of C(n,{1,3}) AGH University
11:55–12:15	Agnieszka Widz Reviving the Theory of Infinite Random Graphs Łódź University of Technology	Stepan Vakhrushev The threshold for a rainbow F-factors and a spread condition for colourings Uppsala University	Gabriella Rácz Interpretations of difference sequences of some combinatorial number sequences University of Debrecen	Raina Mary Thomas On the covering array number of 3-uniform qualitative independence hypergraphs Birla Institute of Technology and Science Pilani
12:20–12:40		Henri Ortmüller Drawing strategies in Strong Ramsey games for 3-uniform hypergraphs University of Fribourg	Piotr Miska Connections between certain numbers related to derangements and r-permutations Jagiellonian University
13:00	Lunch
14:50	Erdős Problems Session
14:50–15:40	Tomasz Łuczak My favorite Erdős’ problems Adam Mickiewicz University
15:40–16:10	Coffee break
16:10–17:00	Thomas Bloom Counterexamples to Erdős University of Manchester
17:05–17:35	Benjamin Bedert Large Sum-free subsets of integers University of Cambridge
17:35–18:05	Stijn Cambie Resolutions of no. 34 and no. 35 in the graph theory collection KU Leuven
18:10–18:40	Wouter van Doorn Dense Interval Sums of Unit Fractions
19:00	Barbecue

Friday, September 25

7:30–9:00	Breakfast
9:10–10:00	Bartosz Walczak Recent progress on the Erdős-Hajnal problem on high-girth high-chromatic subgraphs Jagiellonian University
	Session A	Session B	Session C	Session D
10:15–10:35	Jadwiga Czyżewska Induced Erdős-Pósa property for long holes, thetas, and beyond University of Warsaw	Rui Alde Lopes New bounds for the torus variant of the no-three-in-a-line problem London School of Economics and Political Science	Peter Borg Isolation of graphs University of Malta	Anna Nenca Local computation of parity in cellular automata University of Gdańsk
10:40–11:00	Patryk Morawski Almost tight bounds for induced subdivisions ETH Zürich	Cameron Strachan The number of occurrences of the two smallest distances London School of Economics	Aleksandra Gorzkowska Independent domination in planar graphs AGH University	Tomasz Skalski Level sets and maximum likelihood estimation for the Ising model Wrocław University of Science and Technology
11:00–11:30	Coffee break
11:30–11:50	Jędrzej Hodor Invitation to torso parameters of annotated graphs Jagiellonian University	Kunal Dutta Finding near-optimal centerpoints via Tverberg points University of Warsaw	Julia Kozik On the integrity of Cartesian products of graphs AGH University	Błażej Wróbel Survivable networks design via random spanning trees Wrocław University of Science and Technology
11:55–12:15	Krzysztof Kosiorowski Coarse Menger’s Theorem for two paths Jagiellonian University	Arsenii Sagdeev Monochromatic unit cycles in the plane Karlsruhe Institute of Technology	Małgorzata Sulkowska Community detection via star modularity Wrocław University of Science and Technology	Krystian Gajdzica On the partition function of a rectangle Jagiellonian University
12:20–12:40	Bartłomiej Lewandowski Coarse properties of vertex-minor closed classes of graphs University of Warsaw	Firdavs Rakhmonov L^p averages of the discrete Fourier transform and applications University of St Andrews	Dániel Gábor Simon What are the Possible Values of the Conductance of a Graph? Alfréd Rényi Institute of Mathematics
13:00	Lunch
14:45–15:35	Dömötör Pálvölgyi NCIS: Ramsey – A nearcircumsphere-Ramsey Theorem for Solvable Transitive Configurations Eötvös Loránd University
15:40–16:00	Karolina Okrasa Hypergraph colourings and strong sparsification Warsaw University of Technology
16:05–16:25	Mykhaylo Tyomkyn On plane rigidity matroids Charles University
16:30–17:00	Coffee break
17:00–17:20	Piotr Micek Asymptotic dimension of graphs excluding an induced or fat minor Jagiellonian University
17:25–17:45	Marcin Pilipczuk A polynomial coreset for furthest neighbor in planar metrics University of Warsaw
17:50–18:10	Tom Trotter Progress report on Boolean dimension and planarity Georgia Institute of Technology
18:30	Dinner

Saturday, September 26

7:30–9:00	Breakfast
8:30	Bus no. 1 to Poznań
9:30	Bus no. 2 to Poznań