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
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 -dimensional projective space is at least -chromatic, unless it is bipartite. They conjectured that for any integers and , the Schrijver graph contains a spanning subgraph which is a quadrangulation of . The purpose of this paper is to prove the conjecture.
Full work available at URL: https://arxiv.org/abs/1604.01582
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient data structure for representing and simplifying simplicial complexes in high dimensions
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Kneser's conjecture, chromatic number, and homotopy
- Title not available (Why is that?)
- Coloring graphs with fixed genus and girth
- Higher minors and van Kampen's obstruction
- Colouring quadrangulations of projective spaces
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)