DeepAI AI Chat
Log In Sign Up

The Z_2-genus of Kuratowski minors

by   Radoslav Fulek, et al.
Charles University in Prague

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 Z_2-genus of a graph G is the minimum g such that G has an independently even drawing on the orientable surface of genus g. An unpublished result by Robertson and Seymour implies that for every t, every graph of sufficiently large genus contains as a minor a projective t× t grid or one of the following so-called t-Kuratowski graphs: K_3,t, or t copies of K_5 or K_3,3 sharing at most 2 common vertices. We show that the Z_2-genus of graphs in these families is unbounded in t; in fact, equal to their genus. Together, this implies that the genus of a graph is bounded from above by a function of its Z_2-genus, solving a problem posed by Schaefer and Štefankovič, and giving an approximate version of the Hanani-Tutte theorem on orientable surfaces.


page 1

page 2

page 3

page 4


Z_2-genus of graphs and minimum rank of partial symmetric matrices

The genus g(G) of a graph G is the minimum g such that G has an embeddin...

Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4

We find a graph of genus 5 and its drawing on the orientable surface of ...

Minor-Universal Graph for Graphs on Surfaces

We show that, for every n and every surface Σ, there is a graph U embedd...

Drawing Shortest Paths in Geodetic Graphs

Motivated by the fact that in a space where shortest paths are unique, n...

A note on choosability with defect 1 of graphs on surfaces

This note proves that every graph of Euler genus μ is 2 + √(3μ + 3) --c...

Thickness and Antithickness of Graphs

This paper studies questions about duality between crossings and non-cro...

Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017)

This is the arXiv index for the electronic proceedings of the 25th Inter...