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, December 06, 2022, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Jozef Skokan (LSE)

Graphs with large minimum degree and large girth are three-colourable

Let F be a fixed family of graphs. The homomorphism threshold of F is the infimum of those α for which there exists an F-free graph H=H(F, α), such that every F-free graph on n vertices of minimum degree α n is homomorphic to H.

Letzter and Snyder showed that the homomorphism threshold of the family {C3, C5} is 1/5. They also found explicit graphs H(F, α), for α> 1/5 + ε, which were in addition 3-colourable. Thus, their result also implies that {C3, C5}-free graphs of minimum degree at least (1/5 + ε)n are 3-colourable. For longer cycles, Ebsen and Schacht showed that the homomorphism threshold of {C3, C5, ... , C2k-1} is 1/(2k-1). However, their proof does not imply a good bound on the chromatic number of {C3, C5, ... , C2k-1}-free graphs of minimum degree n/(2k-1). Answering a question of Letzter and Snyder, we prove that such graphs are 3-colourable.

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