The width of quadrangulations of the projective plane

From MaRDI portal



Abstract: We show that every 4-chromatic graph on n vertices, with no two vertex-disjoint odd cycles, has an odd cycle of length at most frac12,(1+sqrt8n7). Let G be a non-bipartite quadrangulation of the projective plane on n vertices. Our result immediately implies that G has edge-width at most frac12,(1+sqrt8n7), which is sharp for infinitely many values of n. We also show that G has face-width (equivalently, contains an odd cycle transversal of cardinality) at most frac14(1+sqrt16n15), which is a constant away from the optimal; we prove a lower bound of sqrtn. Finally, we show that G has an odd cycle transversal of size at most sqrt2Deltan inducing a single edge, where Delta is the maximum degree. This last result partially answers a question of Nakamoto and Ozeki.











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)