Jun 1, 2022 · This is the first finite upper bound on the number of crossings in star-simple drawings of the complete graph K n with no empty lens. For a ...

We consider star-simple drawings of Kn with no empty lens. In this setting we prove an upper bound of 3((n − 4)!) on the maximum number of crossings between any ...

Missing: Kn | Show results with:Kn

In this work, we will give an upper bound of 3(n−4)! for the maximum crossing number of star-simple drawings of Kn with no empty lens and therefore answer this ...

This is the first finite upper bound on the number of crossings in star-simple drawings of the complete graph Kn with no empty lens.

We consider star-simple drawings of K n with no empty lens. In this setting we prove an upper bound of on the maximum number of crossings between any pair of ...

In this work, we will give an upper bound of 3(n−4)! for the maximum crossing number of star-simple drawings of Kn with no empty lens and therefore answer this ...

Missing: Kn | Show results with:Kn

We consider star-simple drawings of K n K_n with no empty lens. In this setting we prove an upper bound of 3 ( ( n − 4 ) ! ) 3((n-4)!) on the maximum number of ...

Aug 25, 2020 · An upper bound of $3((n-4)!)$ is proved on the maximum number of crossings between any pair of edges in a star-simple drawing of a graph.