DeepAI AI Chat
Log In Sign Up

On the number of edges of separated multigraphs

by   Jacob Fox, et al.
NYU college
University of California, San Diego
Stanford University

We prove that the number of edges of a multigraph G with n vertices is at most O(n^2log n), provided that any two edges cross at most once, parallel edges are noncrossing, and the lens enclosed by every pair of parallel edges in G contains at least one vertex. As a consequence, we prove the following extension of the Crossing Lemma of Ajtai, Chvátal, Newborn, Szemerédi and Leighton, if G has e ≥ 4n edges, in any drawing of G with the above property, the number of crossings is Ω(e^3/n^2log(e/n)). This answers a question of Kaufmann et al. and is tight up to the logarithmic factor.


page 1

page 2

page 3

page 4


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...

On RAC Drawings of Graphs with one Bend per Edge

A k-bend right-angle-crossing drawing or (k-bend RAC drawing, for short)...

On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens

A star-simple drawing of a graph is a drawing in which adjacent edges do...

Minimizing Visible Edges in Polyhedra

We prove that, given a polyhedron 𝒫 in ℝ^3, every point in ℝ^3 that does...

Improving Accuracy and Scalability of the PC Algorithm by Maximizing P-value

A number of attempts have been made to improve accuracy and/or scalabili...

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 ...

Approximating the Bundled Crossing Number

Bundling crossings is a strategy which can enhance the readability of dr...