On the number of halving planes
From MaRDI portal
Publication:2639341
DOI10.1007/BF02123008zbMath0718.52009OpenAlexW2120948000MaRDI QIDQ2639341
László Lovász, Imre Bárány, Zoltan Fueredi
Publication date: 1990
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02123008
Related Items
On the expected number of \(k\)-sets, On a conjecture of Karasev, Counting triangle crossings and halving planes, Stabbing simplices by points and flats, Cutting dense point sets in half, A survey of mass partitions, Tverberg plus constraints, Point Selections and Weak ε-Nets for Convex Hulls, Helge Tverberg is eighty: a personal tribute, A Tverberg-type result on multicolored simplices, A note on stabbing convex bodies with points, lines, and flats, Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story, On levels in arrangements of surfaces in three dimensions, Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1, Total polynomials of uniform oriented matroids, On weak \(\epsilon\)-nets and the Radon number, Points and triangles in the plane and halving planes in space, A geometric proof of the colored Tverberg theorem, Upper bounds for stabbing simplices by a line, Pach's selection theorem does not admit a topological extension, Equal coefficients and tolerance in coloured Tverberg partitions, The colored Tverberg's problem and complexes of injective functions, Lower bounds for weak epsilon-nets and stair-convexity, Chessboard complexes indomitable, Median spheres: Theory, algorithms, applications, Cutting a bunch of grapes by a plane, On the complexity of the \(k\)-level in arrangements of pseudoplanes, Unnamed Item, Unnamed Item, Tverberg’s theorem is 50 years old: A survey, Crossing-free segments and triangles in point configurations, Eppstein's bound on intersecting triangles revisited, Median hyperplanes in normed spaces -- a survey, Optimal bounds for the colored Tverberg problem, Helly-type problems
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
