Schrijver graphs and projective quadrangulations

From MaRDI portal
Publication:4604387

DOI10.1007/978-3-319-44479-6_20zbMATH Open1382.05048arXiv1604.01582OpenAlexW2341382418MaRDI QIDQ4604387FDOQ4604387


Authors: Tomáš Kaiser, Matěj Stehlík Edit this on Wikidata


Publication date: 26 February 2018

Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)

Abstract: In a recent paper [J. Combin. Theory Ser. B}, 113 (2015), pp. 1-17], the authors have extended the concept of quadrangulation of a surface to higher dimension, and showed that every quadrangulation of the n-dimensional projective space Pn is at least (n+2)-chromatic, unless it is bipartite. They conjectured that for any integers kgeq1 and ngeq2k+1, the Schrijver graph SG(n,k) contains a spanning subgraph which is a quadrangulation of Pn2k. The purpose of this paper is to prove the conjecture.


Full work available at URL: https://arxiv.org/abs/1604.01582




Recommendations



Cites Work


Cited In (6)





This page was built for publication: Schrijver graphs and projective quadrangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604387)