On sets of points that determine only acute angles
DOI10.1016/J.EJC.2008.07.020zbMATH Open1181.52013OpenAlexW2085975631MaRDI QIDQ1024284FDOQ1024284
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
Recommendations
Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Other problems of combinatorial convexity (52A37)
Cites Work
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- On uncrowded hypergraphs
- Über zwei Probleme bezüglich konvexer Körper von P. Erdős und von V.L. Klee
- Title not available (Why is that?)
- The Algorithmic Aspects of Uncrowded Hypergraphs
- Sets of points determining only acute angles and some related colouring problems
- A Lower Bound for Heilbronn'S Problem
Cited In (9)
- Cardinality estimation of support of the global minimizer for the interaction energy with mildly repulsive potentials
- Danzer-Grünbaum acute-angled triangles
- Acute sets
- Too Acute to Be True: The Story of Acute Sets
- Title not available (Why is that?)
- ON POINT SETS IN VECTOR SPACES OVER FINITE FIELDS THAT DETERMINE ONLY ACUTE ANGLE TRIANGLES
- Repeated Angles in Three and Four Dimensions
- The right acute angles problem?
- Sets of points determining only acute angles and some related colouring problems
This page was built for publication: On sets of points that determine only acute angles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024284)
