English

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 nn-dimensional projective space PnP^n is at least (n+2)(n+2)-chromatic, unless it is bipartite. They conjectured that for any integers k1k\geq 1 and n2k+1n\geq 2k+1, the Schrijver graph SG(n,k)SG(n,k) contains a spanning subgraph which is a quadrangulation of Pn2kP^{n-2k}. The purpose of this paper is to prove the conjecture.

Keywords

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}
}
R2 v1 2026-06-22T13:26:23.920Z