Colouring quadrangulations of projective spaces

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43925352" target="_blank" >RIV/49777513:23520/15:43925352 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.jctb.2014.12.007" target="_blank" >http://dx.doi.org/10.1016/j.jctb.2014.12.007</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jctb.2014.12.007" target="_blank" >10.1016/j.jctb.2014.12.007</a>

Result language
angličtina
Original language name
Colouring quadrangulations of projective spaces
Original language description
A graph embedded in a surface with all faces of size 4 is known as a quadrangulation. We extend the definition of quadrangulation to higher dimensions, and prove that any graph G which embeds as a quadrangulation in the real projective space Pn has chromatic number n+2 or higher, unless G is bipartite. For n=2 this was proved by Youngs (1996). The family of quadrangulations of projective spaces includes all complete graphs, all Mycielski graphs, and certain graphs homomorphic to Schrijver graphs. As a corollary, we obtain a new proof of the Lovász-Kneser theorem.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)