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 -genus of a graph is the minimum such that has an independently even drawing on the orientable surface of genus . An unpublished result by Robertson and Seymour implies that for every , every graph of sufficiently large genus contains as a minor a projective grid or one of the following so-called -Kuratowski graphs: , or copies of or sharing at most two common vertices. We show that the -genus of graphs in these families is unbounded in ; in fact, equal to their genus. Together, this implies that the genus of a graph is bounded from above by a function of its -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 -genus of graphs.

生成讲解博客的中文版本

生成AI智能校验的中文版本