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, November 17, 2022, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Charlotte Knierim

Oriented Discrepancy of Hamilton cycles

Let G be an n-vertex graph of minimum degree δ(G) ≥ n/2, where n is sufficiently large. We show that for every ξ > 0 and every orientation of the edges of G, there exists a Hamilton cycle of $G$ with at least δ(G) - ξn edges oriented in accordance with the direction of the cycle. This proves an asymptotic version of a conjecture of Gishboliner, Krivelevich, and Michaeli.
This is joint work with Micha Christoph, Dan Hefetz and Stefanie Gerke


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

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