Schrijver graphs and projective quadrangulations - [Labex] PERSYVAL-lab Accéder directement au contenu
Chapitre D'ouvrage Année : 2017

Schrijver graphs and projective quadrangulations

Résumé

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

Dates et versions

hal-01683801 , version 1 (14-01-2018)

Identifiants

Citer

Tomáš Kaiser, Matej Stehlik. Schrijver graphs and projective quadrangulations. A Journey Through Discrete Mathematics, 2017, ⟨10.1007/978-3-319-44479-6_20⟩. ⟨hal-01683801⟩
246 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More