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 12, 2021, 12:15 pm

Duration: 30 minutes

Location: CAB G51 and Zoom: conference room

Speaker: Stefan Glock

New results for MaxCut in H-free graphs

The MaxCut problem asks for the size mc(G) of a largest cut in a graph G. It is well known that mc(G)\ge m/2 for any m-edge graph G, and the difference mc(G)-m/2 is called the surplus of G. The study of the surplus of H-free graphs was initiated by Erd\H{o}s and Lov\'asz in the 70s, who in particular asked what happens for triangle-free graphs. This was famously resolved by Alon, who showed that in the triangle-free case the surplus is \Omega(m^{4/5}), and found constructions matching this bound. We prove several new results in this area. First, we obtain an optimal bound when $H$ is an odd cycle, adding to the lacunary list of graphs for which such a result is known. Secondly, we extend the result of Alon in the sense that we prove optimal bounds on the surplus of general graphs in terms of the number of triangles they contain. Thirdly, we improve the currently best bounds for K_r-free graphs. Our proofs combine techniques from semidefinite programming, probabilistic reasoning, as well as combinatorial and spectral arguments. Joint work with Oliver Janzer and Benny Sudakov

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