English

The $\mathbb{Z}_2$-genus of Kuratowski minors

Combinatorics 2022-10-03 v4 Discrete Mathematics

Abstract

A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The Z2\mathbb{Z}_2-genus of a graph GG is the minimum gg such that GG has an independently even drawing on the orientable surface of genus gg. An unpublished result by Robertson and Seymour implies that for every tt, every graph of sufficiently large genus contains as a minor a projective t×tt\times t grid or one of the following so-called tt-Kuratowski graphs: K3,tK_{3,t}, or tt copies of K5K_5 or K3,3K_{3,3} sharing at most two common vertices. We show that the Z2\mathbb{Z}_2-genus of graphs in these families is unbounded in tt; in fact, equal to their genus. Together, this implies that the genus of a graph is bounded from above by a function of its Z2\mathbb{Z}_2-genus, solving a problem posed by Schaefer and \v{S}tefankovi\v{c}, and giving an approximate version of the Hanani-Tutte theorem on orientable surfaces. We also obtain an analogous result for Euler genus and Euler Z2\mathbb{Z}_2-genus of graphs.

Keywords

Cite

@article{arxiv.1803.05085,
  title  = {The $\mathbb{Z}_2$-genus of Kuratowski minors},
  author = {Radoslav Fulek and Jan Kynčl},
  journal= {arXiv preprint arXiv:1803.05085},
  year   = {2022}
}

Comments

25 pages, 10 figures; minor revision