We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Crossing numbers

00:00

Formal Metadata

Title
Crossing numbers
Title of Series
Number of Parts
24
Author
Contributors
License
CC Attribution - NonCommercial - NoDerivatives 4.0 International:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
One of the most useful tools in topological graph theory is the so-called Crossing Lemma of Ajtai, Chvatal, Newborn, Szemeredi (1982) and Leighton (1983). It states, roughly speaking, that if a graph drawn in the plane has much more edges than vertices, then the number of crossings between its edges is much larger than the number of edges. We extend this result to simple topological multigraphs, that is, for multigraphs drawn in the plane such that (1) any two independent edges meet in at most one point, (2) no two edges that share an endpoint have any interior point in common, and (3) both lenses enclosed by two edges that have the same endpoint contain at least one vertex in their interiors.
Keywords