Skip to search formSkip to main contentSkip to account menu

Crossing number inequality

Known as: Crossing lemma 
In the mathematics of graph drawing, the crossing number inequality or crossing lemma gives a lower bound on the minimum number of crossings of a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Crossing number (graph theory)Girth (graph theory)Graph (discrete mathematics)Graph drawing

Broader (1)

Topological graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A Radial Basis Function Algorithm with Automatic Model Order Determination
We present a new radial basis function (RBF) algorithm for constructing nonlinear models from data that may be sparsely scattered… 
2015
2015
2 The crossing lemma
We use standard asymptotic notation. That is, f(n) = O(g(n)) implies that there exist constants c, n0, such that for any n ≥ n0… 
2015
2015
A Szemerédi–Trotter Type Theorem in R[superscript 4]
United States. Department of Defense (National Defense Science & Engineering Graduate Fellowship (NDSEG) Program) 
2013
2013
A Crossing Lemma for Annular Regions and Invariant Sets with an Application to Planar Dynamical Systems
We present a topological result, named crossing lemma, dealing with the existence of a continuum which crosses a topological… 
Review
2005
Review
2005
Incidence Problems in Plane and Higher Dimensions
This is a survey paper of recent results about the problem of counting number of incidences between points and curves in the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)