Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

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)

Generalised Turan Game

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login