DeepAI AI Chat
Log In Sign Up

An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants

by   Oswin Aichholzer, et al.
TU Graz

A drawing of a graph in the plane is pseudolinear if the edges of the drawing can be extended to doubly-infinite curves that form an arrangement of pseudolines, that is, any pair of edges crosses precisely once. A special case are rectilinear drawings where the edges of the graph are drawn as straight line segments. The rectilinear (pseudolinear) crossing number of a graph is the minimum number of pairs of edges of the graph that cross in any of its rectilinear (pseudolinear) drawings. In this paper we describe an ongoing project to continuously obtain better asymptotic upper bounds on the rectilinear and pseudolinear crossing number of the complete graph K_n.


page 17

page 19

page 20

page 22

page 26

page 29

page 40

page 42


On the 2-colored crossing number

Let D be a straight-line drawing of a graph. The rectilinear 2-colored c...

The Tripartite-Circle Crossing Number of K_2,2,n

A tripartite-circle drawing of a tripartite graph is a drawing in the pl...

Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4

We find a graph of genus 5 and its drawing on the orientable surface of ...

Edge-Minimum Saturated k-Planar Drawings

For a class 𝒟 of drawings of loopless multigraphs in the plane, a drawin...

Towards Better Approximation of Graph Crossing Number

Graph Crossing Number is a fundamental problem with various applications...

Extending drawings of complete graphs into arrangements of pseudocircles

Motivated by the successful application of geometry to proving the Harar...

The number of crossings in multigraphs with no empty lens

Let G be a multigraph with n vertices and e>4n edges, drawn in the plane...