Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unified Hanani-Tutte theorem

Published 2 Dec 2016 in math.CO and cs.DM | (1612.00688v3)

Abstract: We introduce a common generalization of the strong Hanani-Tutte theorem and the weak Hanani-Tutte theorem: if a graph $G$ has a drawing $D$ in the plane where every pair of independent edges crosses an even number of times, then $G$ has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in $D$. 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.

Citations (10)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.