On sets of points that determine only acute angles

DOI10.1016/j.ejc.2008.07.020zbMath1181.52013OpenAlexW2085975631MaRDI QIDQ1024284

Oren Ben-Zwi, Eyal Ackerman

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.07.020

zbMATH Keywords

hypergraphsprobabilistic methodsacute anglesfinite point sets

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Other problems of combinatorial convexity (52A37) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (5)

The right acute angles problem? ⋮ Cardinality estimation of support of the global minimizer for the interaction energy with mildly repulsive potentials ⋮ Acute sets ⋮ ON POINT SETS IN VECTOR SPACES OVER FINITE FIELDS THAT DETERMINE ONLY ACUTE ANGLE TRIANGLES ⋮ Too Acute to Be True: The Story of Acute Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Sets of points determining only acute angles and some related colouring problems
• Über zwei Probleme bezüglich konvexer Körper von P. Erdős und von V.L. Klee
• A Lower Bound for Heilbronn'S Problem
• The Algorithmic Aspects of Uncrowded Hypergraphs
• On uncrowded hypergraphs

This page was built for publication: On sets of points that determine only acute angles