Unified Hanani-Tutte theorem
Combinatorics
2017-08-01 v3 Discrete Mathematics
Abstract
We introduce a common generalization of the strong Hanani-Tutte theorem and the weak Hanani-Tutte theorem: if a graph has a drawing in the plane where every pair of independent edges crosses an even number of times, then has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in . The theorem is implicit in the proof of the strong Hanani-Tutte theorem by Pelsmajer, Schaefer and \v{S}tefankovi\v{c}. We give a new, somewhat simpler proof.
Cite
@article{arxiv.1612.00688,
title = {Unified Hanani-Tutte theorem},
author = {Radoslav Fulek and Jan Kynčl and Dömötör Pálvölgyi},
journal= {arXiv preprint arXiv:1612.00688},
year = {2017}
}
Comments
8 pages, 3 figures; minor revision, mostly in the abstract and Section 4