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

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Jiří Matoušek (Charles Univ., Prague)

Large Monochromatic Components in Two-colored Grids

We consider the d-dimensional grid with diagonals, that is, the graph whose vertex set is [n]^d and two vertices are connected by an edge exactly if they differ by at most 1 in every coordinate. We prove that under every 2-coloring of the vertex set, there is a monochromatic connected subgraph with at least n^{d-1}-d^2 n^{d-2} vertices. This almost matches the obvious upper bound of n^{d-1}, obtained from the "horizontal layer" coloring. We also study a similar question for triangulated d-dimensional grids.

Joint work with Aleš Přívětivý.

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