# BPHW Seminar in Discrete Mathematics 2024

**May 24-25, 2024**** Freie Universität Berlin**

This series of meetings was initiated in the mid 90's as a seminar between the research groups of Prof. Michał Karoński (Adam Mickiewicz University, Poznań) and Prof. Hans Jürgen Prömel ((at the time) Humboldt University Berlin). Since then the meeting has evolved into a yearly two-day joint workshop, and more recently groups from the University of Hamburg, TU Hamburg, and TU Warsaw have joined as well. The scope of the seminar covers a broad range of central topics in modern Discrete Mathematics, including random discrete structures and algorithms, extremal and probabilistic combinatorics, algorithmic discrete mathematics and related fields. This year the event takes place on May 24 and 25 at the Freie Universität Berlin.

** Registration**

This seminar is free and open to anyone interested. To register, please fill out the form which you can find via the following link:

https://forms.gle/G37Kfz1iuoKw639k7

**List of Participants**

Location

Location

Freie Universität Berlin

Institut für Mathematik

Arnimallee 3 (Room 001)

14195 Berlin

Germany

**Programm Overview**

**Friday**

Time | Title | |

13:30 - 13:55 | Arrival of Participants | |

13:55 - 14:00 | Opening Remarks | |

14:00 - 14:30 | Małgorzata Śleszyńska-Nowak | Strongly Proper Connected Coloring |

14:30 - 15:00 | Irene Muzi | An elementary bound for the directed grid theorem |

15:00 - 15:30 | Sylwia Antoniuk | Clique factors in randomly augmented graphs |

15:30 - 16:00 | Coffee Break | |

16:00 - 16:45 | Letícia Mattos | Clique packings in random graphs |

16:45 - 17:15 | Yannick Mogge | Creating a tree universal graph in Waiter-Client games |

17:15 - 17:30 | Coffee Break | |

17:30 - 18:00 | Alexandra Wesolek | Subgraph-universal planar graphs for trees |

18:00 - 18:30 | Michał Dębski | Avoiding Tangrams |

19:30 - | Dinner at Altensteiner Krug | Altensteinstraße 42, 14195 Berlin |

**Saturday**

Time | Title | |

8:30 - 9:00 | Katarzyna Rybarczyk-Krzywdzinska | Small subgraphs in random intersection graphs |

9:00 - 9:30 | Hubert Grochowski | Approximation algorithms for L(2,1)-labeling of unit disk graphs |

9:30 - 10:00 | Silas Rathke | On the maximum diameter of d-dimensional simplicial complexes |

10:00 - 10:30 | Coffee Break | |

10:30 - 11:15 | Stefan Glock | Tight Hamilton cycles with high discrepancy |

11:15 - 11:45 | Fabian Hamann | Speed and size of dominating sets in domination games |

11:45 - 12:00 | Coffee Break | |

12:00 - 12:30 | Andrzej Rucinski | Twins everywhere. How big is the problem. |

12:30 - 13:00 | Simón Piga | Turán problems for simplicial complexes |

13:00 - 13:05 | Closing Remarks |

**Organizers**

Olaf Parczyk, Silas Rathke, Tibor Szabó, Alexandra Wesolek