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: Thursday, October 12, 2023, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Raphael Steiner

Chromatic number is not tournament-local

Scott and Seymour conjectured the existence of a function f:N→N such that, for every graph G and tournament T on the same vertex set, χ(G)⩾f(k) implies that χ(G[N+T(v)])⩾k for some vertex v. In this note we disprove this conjecture even if v is replaced by a vertex set of size O(log |V(G)|). As a consequence, we answer in the negative a question of Harutyunyan, Le, Thomassé, and Wu concerning the corresponding statement where the graph G is replaced by another tournament, and disprove a related conjecture of Nguyen, Scott, and Seymour. We also show that the setting where chromatic number is replaced by degeneracy exhibits a quite different behaviour. Based on joint work with Girao, Illingworth, Hendrey, Lehner, Michel and Savery.

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