The width of quadrangulations of the projective plane
From MaRDI portal
Abstract: We show that every -chromatic graph on vertices, with no two vertex-disjoint odd cycles, has an odd cycle of length at most . Let be a non-bipartite quadrangulation of the projective plane on vertices. Our result immediately implies that has edge-width at most , which is sharp for infinitely many values of . We also show that has face-width (equivalently, contains an odd cycle transversal of cardinality) at most , which is a constant away from the optimal; we prove a lower bound of . Finally, we show that has an odd cycle transversal of size at most inducing a single edge, where is the maximum degree. This last result partially answers a question of Nakamoto and Ozeki.
Recommendations
Cited in
(6)- A proof of a dodecahedron conjecture for distance sets
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)
- Chromatic numbers of quadrangulations on closed surfaces
- Quadrangulations and 5-critical graphs on the projective plane
- Projective Reeds-Shepp car onS2with quadratic cost
- Schrijver graphs and projective quadrangulations
This page was built for publication: The width of quadrangulations of the projective plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553729)