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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, September 17, 2013, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Humberto Naves

We study an old problem of Linial and Wilf to find the graphs with n vertices and m edges which maximize the number of proper q-colorings of their vertices. In a breakthrough paper, Loh, Pikhurko and Sudakov reduced the problem to an optimization problem and solved it asymptotically for many ranges of parameters. We show that, for any possible choice of parameters, the optimization problem always has a solution which corresponds to either a complete multipartite graph or a graph obtained from complete multipartite graph by removing edges of two bipartite subgraphs. There are examples showing that each of the two classes of graphs is indeed optimal for certain instances of the problem. We then apply this structural result to the particular case when m corresponds to the number of edges of the Turan graph T_s(n) on n vertices with s nearly equal parts. A conjecture of Lazebnik from 1989 asserts that for any q >= s >= 2 the Turan graph T_s(n) has the maximum number of q-colorings among all graphs with the same number of vertices and edges. We disprove this conjecture by providing infinitely many counterexamples when s >= 11 and s + 8 =< q =< 2s - 3. On the positive side, we show that if q = Omega(s^2), then T_s(n) indeed achieves the maximum number of q-colorings.

Joint work with Jie Ma

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

Previous talks by year: 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