Program

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