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

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Christian Wieser

Online Ramsey Game for Bow-tie Graphs (Master Thesis)

Consider the following one-player game played on an initially empty graph on n vertices. In every round one randomly chosen edge will be inserted and the player has to color this edge with one of the r available colors. How long does it take, before he is forced to create a monochromatic copy of F? For some graphs the threshold is already known. One graph not being in that class is the bow-tie graph where two triangles are connected at one point. In the talk the threshold for that graph and two colors will be presented.

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