The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability

DOI10.2307/2975158zbMath0834.05022OpenAlexW4241647584WikidataQ54152679 ScholiaQ54152679MaRDI QIDQ4859605

Herbert S. Wilf, Edward R. Scheinerman

Publication date: 31 March 1996

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2975158

zbMATH Keywords

geometryprobabilityconvex hulldrawingrectilinear crossing numbercomplete graphplanefour point problem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of finite geometries (05B25)

Related Items

Geometric drawings of \(K_{n}\) with few crossings, From art and circuit design to geometry and combinatorics, Approximating the Rectilinear Crossing Number, An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\), The Crossing Number of Graphs: Theory and Computation, Approximating the rectilinear crossing number, Limiting Crossing Numbers for Geodesic Drawings on the Sphere, On the crossing number of complete graphs