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, October 04, 2016, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Nina Kamcev

Anagram-free Colourings of Graphs

Answering a question of Erdős and Brown, Keränen constructed an infinite anagram-free sequence on four symbols, that is, a sequence which contains no consecutive symbols r1r2...rkrk+1...r2k such that rk+1...r2k is a permutation of the block r1...rk. Motivated by the work of Alon, Grytczuk, Hałuszczak and Riordan, we study a natural generalisation of anagram-free sequences for graph colourings. We touch upon results for paths, trees, minor-free graphs and bounded-degree graphs. Surprisingly, there are bounded-degree graphs (such as random regular graphs) in which anagrams cannot be avoided unless we basically give each vertex a separate color.

Joint work with Tomasz Łuczak and Benny Sudakov.

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