Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, September 27, 2022, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Miloš Stojaković (University of Novi Sad)
We study a game motivated by the Generalised Turan Problem. Let H and F be graphs, and n an integer. Two players, Constructor and Blocker, alternately claim unclaimed edges of the complete graph on n vertices. Constructor is not allowed to claim a copy of F, and his goal is to maximise the number of claimed copies of H. Blocker plays without restriction, and his goal is to minimise the number of copies of H Constructor claimed. When both players play optimally the score of the game, denoted by gc(n, H, F), is the number of copies of H Constructor claimed. We look for the game score for several natural choices of H and F.
This is joint work with Balázs Patkós and Máté Vizer.
Automatic MiSe System Software Version 1.4803M | admin login