Schrijver graphs and projective quadrangulations
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 k≥ 1 and n≥ 2k+1, the Schrijver graph SG(n,k) contains a spanning subgraph which is a quadrangulation of Pn-2k. The purpose of this paper is to prove the conjecture.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.