On the number of halving planes

DOI10.1007/BF02123008zbMath0718.52009MaRDI QIDQ2639341

László Lovász, Imre Bárány, Zoltan Fueredi

Publication date: 1990

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

halving plane; n-set in general position

Mathematics Subject Classification ID

52A37: Other problems of combinatorial convexity

Related Items

Point Selections and Weak ε-Nets for Convex Hulls, Cutting a bunch of grapes by a plane, Crossing-free segments and triangles in point configurations, On levels in arrangements of surfaces in three dimensions, Lower bounds for weak epsilon-nets and stair-convexity, Chessboard complexes indomitable, A geometric proof of the colored Tverberg theorem, Stabbing simplices by points and flats, Eppstein's bound on intersecting triangles revisited, Points and triangles in the plane and halving planes in space, The colored Tverberg's problem and complexes of injective functions, Median hyperplanes in normed spaces -- a survey, On the expected number of \(k\)-sets, Counting triangle crossings and halving planes, Cutting dense point sets in half, A Tverberg-type result on multicolored simplices, Total polynomials of uniform oriented matroids, Median spheres: Theory, algorithms, applications

Cites Work

• Unnamed Item
• Unnamed Item
• Supersaturated graphs and hypergraphs
• The number of triangles covering the center of an \(n\)-set
• On empty triangles determined by points in the plane
• Hypergraphs do not jump
• A generalization of Caratheodory's theorem
• On extremal problems of graphs and generalized graphs
• An extension of Radon's theorem
• Empty Simplices in Euclidean Space
• A Generalization of Radon's Theorem