The number of triangles covering the center of an \(n\)-set

From MaRDI portal
Publication:1077716

DOI10.1007/BF00181519zbMath0595.52002OpenAlexW2081045879MaRDI QIDQ1077716

Endre Boros, Zoltan Fueredi

Publication date: 1984

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00181519




Related Items

Extremal problems for pairs of trianglesOverlap properties of geometric expandersIsoperimetric inequalities for Ramanujan complexes and topological expandersStabbing simplices by points and flatsk-Centerpoints Conjectures for Pointsets in ℝdOn the number of halving planesThe Caratheodory number for the k-corePoint Selections and Weak ε-Nets for Convex HullsOn Liu's simplicial depth and Randles' interdirectionsA bivariate test for location based on simplicial depthOn expansion and topological overlapIntersection theorems for trianglesHitting simplices with points in \(\mathbb R^{3}\)Carathéodory's theorem in depthAn elementary exposition of topological overlap in the planeCombinatorial properties of nonarchimedean convex setsA simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theoremBounded degree cosystolic expanders of every dimensionAn improvement on the Rado bound for the centerline depthA new lower bound based on Gromov's method of selecting heavily covered pointsRamanujan complexes and high dimensional expandersA proof of the Oja depth conjecture in the planePoints and triangles in the plane and halving planes in spaceOn strong centerpointsUpper bounds for stabbing simplices by a lineA slight improvement to the colored Bárány's theoremQuantitative fractional Helly and \((p,q)\)-theoremsPach's selection theorem does not admit a topological extensionGeometric mediansPositive-fraction intersection results and variations of weak epsilon-netsOja centers and centers of gravityPiercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problemHitting and Piercing Rectangles Induced by a Point SetSingularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetryTverberg’s theorem is 50 years old: A surveyOn Gromov's method of selecting heavily covered pointsBounds for Pach's selection theorem and for the minimum solid angle in a simplexDIRECTED SIMPLICES IN HIGHER ORDER TOURNAMENTSThe discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and TverbergHypergraph expanders from Cayley graphsHelly-type problemsThe filling problem in the cube