On the number of k-subsets of a set of n points in the plane

DOI10.1016/0097-3165(84)90081-5zbMath0523.51003OpenAlexW2057335678MaRDI QIDQ1056369

Jacob E. Goodman, Richard Pollack

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(84)90081-5

zbMATH Keywords

configuration of point sets in the plane

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30) Configuration theorems in linear incidence geometry (51A20)

Related Items (10)

On the expected number of \(k\)-sets ⋮ On `\(k\)-sets' in the plane ⋮ Points and triangles in the plane and halving planes in space ⋮ On \(k\)-sets in arrangements of curves and surfaces ⋮ An upper bound on the number of planar \(K\)-sets ⋮ Applications of random sampling in computational geometry. II ⋮ Semispaces of configurations, cell complexes of arrangements ⋮ On levels in arrangements and Voronoi diagrams ⋮ \(k\)-sets and random hulls ⋮ The number of small semispaces of a finite set of points in the plane

Cites Work

• Semispaces of configurations, cell complexes of arrangements
• On the combinatorial classification of nondegenerate configurations in the plane
• A theorem of ordered duality
• A Partial Order on the Regions of R n Dissected by Hyperplanes
• Some extremal problems in geometry

This page was built for publication: On the number of k-subsets of a set of n points in the plane