Schrijver graphs and projective quadrangulations
Combinatorics
2018-06-19 v1
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.
Cite
@article{arxiv.1604.01582,
title = {Schrijver graphs and projective quadrangulations},
author = {Tomáš Kaiser and Matěj Stehlík},
journal= {arXiv preprint arXiv:1604.01582},
year = {2018}
}