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, June 26, 2018, 12:15 pm

Duration: 30 minutes

Location: CHN C 14

Speaker: Pavel Valtr (Charles University)

The exact chromatic number of the convex segment disjointness graph

Let P be a set of n points in strictly convex position in the plane. Let D_n be the graph whose vertex set is the set of all line segments with endpoints in P, where disjoint segments are adjacent. The chromatic number of this graph was first studied by Araujo, Dumitrescu, Hurtado, Noy, and Urrutia [2005] and then by Dujmovic and Wood [2007]. Improving on their estimates, we prove the following exact formula for the chromatic graph of D_n: \chi(D_n)=n-[\sqrt{n+1/4}-1/2]. Joint work with Ruy Fabila-Monroy, Jakob Jonsson, and David Wood.

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