• In topological graph theory, the HananiTutte theorem is a result on the parity of edge crossings in a graph drawing. It states that every drawing in the...
    9 KB (960 words) - 03:13, 12 April 2025
  • mid-1930s. Even though Tutte's contributions to graph theory have been influential to modern graph theory and many of his theorems have been used to keep...
    42 KB (4,696 words) - 17:22, 30 May 2025
  • Planar graph (redirect from Theorem P)
    eigenvalue of certain Schrödinger operators defined by the graph. The HananiTutte theorem states that a graph is planar if and only if it has a drawing in...
    35 KB (4,541 words) - 18:29, 29 May 2025
  • existence theorem for Steiner quadruple systems. He is also known for the HananiTutte theorem on odd crossings in non-planar graphs. Hanani (Chojnacki)...
    9 KB (719 words) - 19:31, 20 May 2025
  • Thumbnail for Crossing number (graph theory)
    which is at most equal to the crossing number. However, by the HananiTutte theorem, whenever one of these numbers is zero, they all are. Schaefer (2014...
    27 KB (3,160 words) - 20:56, 12 March 2025
  • Thumbnail for Topological graph
    and the pair-crossing number are not the same. It follows from the HananiTutte theorem that odd-cr(G) = 0 implies cr(G) = 0. It is also known that odd-cr(G) = k...
    30 KB (3,579 words) - 11:39, 11 December 2024
  • formula). It also includes the crossing number inequality, and the HananiTutte theorem on the parity of crossings. The second chapter concerns other special...
    4 KB (469 words) - 00:46, 27 February 2025