The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs

05/16/2018
by   Petra Mutzel, et al.
0

The Harary-Hill Conjecture states that for n≥ 3 every drawing of K_n has at least H(n) := 1/4n/2n-1/2n-2/2n-3/2 crossings. In general the problem remains unsolved, however there has been some success in proving the conjecture for restricted classes of drawings. The most recent and most general of these classes is seq-shellability. In this work, we improve these results and introduce the new class of single-pair-seq-shellable drawings. We prove the Harary-Hill Conjecture for this new class using novel results on triple cumulated k-edges. So far, all approaches for proving the Harary-Hill Conjecture for specific classes rely on a globally fixed reference face. We successfully apply new techniques in order to loosen this restriction, which enables us to select different reference faces when considering subdrawings. Furthermore, we introduce the notion of k-deviations as the difference between an optimal and the actual number of k-edges. Using k-deviations, we gain interesting insights into the essence of k-edges, and we further relax the necessity of a fixed reference face.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/16/2018

The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs

The Harary-Hill Conjecture states that for n≥ 3 every drawing of K_n has...
research
03/20/2018

The Crossing Number of Seq-Shellable Drawings of Complete Graphs

The Harary-Hill conjecture states that for every n>0 the complete graph ...
research
07/06/2023

Convex Hull Thrackles

A thrackle is a graph drawn in the plane so that every pair of its edges...
research
07/21/2018

S_12 and P_12-colorings of cubic graphs

If G and H are two cubic graphs, then an H-coloring of G is a proper edg...
research
09/07/2023

Looms

A pair (A,B) of hypergraphs is called orthogonal if |a ∩ b|=1 for every ...
research
08/11/2022

Empty Triangles in Generalized Twisted Drawings of K_n

Simple drawings are drawings of graphs in the plane or on the sphere suc...
research
05/21/2020

On the Partition Bound for Undirected Unicast Network Information Capacity

One of the important unsolved problems in information theory is the conj...

Please sign up or login with your details

Forgot password? Click here to reset