# Noon lecture

list of noon lectures ( 2005 | 2006 | 2007 | 2008 | 2009 | 2010 | 2011 | 2012 | 2013 | 2014 | 2015 | 2016 | 2017 | future lectures)

On 14.05.2015 at 12:20 in S6, there is the following noon lecture:

# Colouring quadrangulations of projective spaces

## Matěj Stehlík

## Abstract

A projective quadrangulation is a graph embedded in the projective plane so that all faces are bounded by four edges. A striking theorem of Youngs asserts that every projective quadrangulation has chromatic number 2 or 4. We will extend the definition of projective quadrangulation to the n-dimensional projective space, and show that the chromatic number of an n-dimensional projective quadrangulation is either 2 or at least n+2. The proof relies on topological methods, namely the Borsuk-Ulam theorem.

We will conclude the talk by applying our result to generalised Mycielski graphs and Kneser graphs.

This is joint work with Tomáš Kaiser.

Webmaster: kamweb.mff.cuni.cz Modified: 19. 10. 2010