Hanani–Tutte theorem

From HandWiki
Short description: On parity of crossings in graph drawings

In topological graph theory, the Hanani–Tutte theorem is a result on the parity of edge crossings in a graph drawing. It states that every drawing in the plane of a non-planar graph contains a pair of independent edges (not both sharing an endpoint) that cross each other an odd number of times. Equivalently, it can be phrased as a planarity criterion: a graph is planar if and only if it has a drawing in which every pair of independent edges crosses evenly (or not at all).[1]

History

The result is named after Haim Hanani, who proved in 1934 that every drawing of the two minimal non-planar graphs K5 and K3,3 has a pair of edges with an odd number of crossings,[2] and after W. T. Tutte, who stated the full theorem explicitly in 1970.[3] A parallel development of similar ideas in algebraic topology has been credited to Egbert van Kampen, Arnold S. Shapiro, and Wu Wenjun.[4][5][6][7][8][9]

Applications

One consequence of the theorem is that testing whether a graph is planar may be formulated as solving a system of linear equations over the finite field of order two. These equations may be solved in polynomial time, but the resulting algorithms are less efficient than other known planarity tests.[1]

Generalizations

For other surfaces S than the plane, a graph can be drawn on S without crossings if and only if it can be drawn in such a way that all pairs of edges cross an even number of times; this is known as the weak Hanani–Tutte theorem for S. The strong Hanani–Tutte theorem states that a graph can be drawn without crossings on S if and only if it can be drawn in such a way that all independent pairs of edges cross an even number of times, without regard for the number of crossings between edges that share an endpoint;[10] this strong version does not hold for all surfaces,[11] but it is known to hold for the plane, the projective plane and the torus.[12]

The same approach, in which one shows that pairs of edges with an even number of crossings can be disregarded or eliminated in some type of graph drawing and uses this fact to set up a system of linear equations describing the existence of a drawing, has been applied to several other graph drawing problems, including upward planar drawings,[13] drawings minimizing the number of uncrossed edges,[14][15] and clustered planarity.[16]

References

  1. ↑ 1.0 1.1 Schaefer, Marcus (2013), "Toward a theory of planarity: Hanani–Tutte and planarity variants", Journal of Graph Algorithms and Applications 17 (4): 367–440, doi:10.7155/jgaa.00298 .
  2. ↑ Chojnacki, Ch. (1934), "Über wesentlich unplättbare Kurven im dreidimensionalen Raume", Fundamenta Mathematicae 23 (1): 135–142, doi:10.4064/fm-23-1-135-142, http://eudml.org/doc/212715 . See in particular (1), p. 137.
  3. ↑ "Toward a theory of crossing numbers", Journal of Combinatorial Theory 8: 45–53, 1970, doi:10.1016/s0021-9800(70)80007-2 .
  4. ↑ Levow, Roy B. (1972), "On Tutte's algebraic approach to the theory of crossing numbers", Proceedings of the Third Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1972), Florida Atlantic Univ., Boca Raton, Fla., pp. 315–314 .
  5. ↑ Schaefer, Marcus, "Hanani–Tutte and related results", in Bárány, I.; Böröczky, K. J.; Tóth, G. F. et al., Geometry—Intuitive, Discrete, and Convex—A Tribute to László Fejes Tóth, Bolyai Society Mathematical Studies, Berlin: Springer, http://ovid.cs.depaul.edu/documents/htsurvey.pdf 
  6. ↑ "Komplexe in euklidischen Räumen", Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 9 (1): 72–78, 1933, doi:10.1007/BF02940628 .
  7. ↑ "On the realization of complexes in Euclidean spaces. I", Acta Mathematica Sinica 5: 505–552, 1955 .
  8. ↑ "Obstructions to the imbedding of a complex in a Euclidean space. I. The first obstruction", Annals of Mathematics, Second Series 66 (2): 256–269, 1957, doi:10.2307/1969998 .
  9. ↑ "On the planar imbedding of linear graphs. I", Journal of Systems Science and Mathematical Sciences 5 (4): 290–302, 1985 . Continued in 6 (1): 23–35, 1986.
  10. ↑ Pelsmajer, Michael J.; Schaefer, Marcus; Stasi, Despina (2009), "Strong Hanani–Tutte on the projective plane", SIAM Journal on Discrete Mathematics 23 (3): 1317–1323, doi:10.1137/08072485X .
  11. ↑ Fulek, Radoslav; Kynčl, Jan (2019), "Counterexample to an extension of the Hanani–Tutte theorem on the surface of genus 4", Combinatorica 39 (6): 1267–1279, doi:10.1007/s00493-019-3905-7 
  12. ↑ Fulek, Radoslav; Pelsmajer, Michael J.; Schaefer, Marcus (2021), "Strong Hanani–Tutte for the torus", in Buchin, Kevin; Colin de Verdière, Éric, 37th International Symposium on Computational Geometry, SoCG 2021, June 7–11, 2021, Buffalo, NY, USA (Virtual Conference), LIPIcs, 189, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 38:1–38:15, doi:10.4230/LIPIcs.SoCG.2021.38 
  13. ↑ Fulek, Radoslav; Pelsmajer, Michael J.; Schaefer, Marcus; Štefanković, Daniel (2013), "Hanani–Tutte, monotone drawings, and level-planarity", Thirty essays on geometric graph theory, Springer, ISBN 978-1-4614-0110-0 .
  14. ↑ "Which crossing number is it anyway?", Journal of Combinatorial Theory, Series B 80 (2): 225–246, 2000, doi:10.1006/jctb.2000.1978 .
  15. ↑ Pelsmajer, Michael J.; Schaefer, Marcus; Štefankovič, Daniel (2007), "Removing even crossings", Journal of Combinatorial Theory, Series B 97 (4): 489–500, doi:10.1016/j.jctb.2006.08.001 .
  16. ↑ Gutwenger, C., "Practical experience with Hanani–Tutte for testing c-planarity", 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 86–97, doi:10.1137/1.9781611973198.9 .



Retrieved from "https://handwiki.org/wiki/index.php?title=Hanani–Tutte_theorem&oldid=3430154"