Maximum Number of Almost Similar Triangles in the Plane
arXiv:2101.10304 · doi:10.1016/j.comgeo.2022.101880
Abstract
A triangle is -similar to another triangle if their angles pairwise differ by at most . Given a triangle , and , Bárány and Füredi asked to determine the maximum number of triangles being -similar to in a planar point set of size . We show that for almost all triangles there exists such that . Exploring connections to hypergraph Turán problems, we use flag algebras and stability techniques for the proof.
arXiv comment20 pages
References in corpus (6)
- Maximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle
- Minimum number of monotone subsequences of length 4 in permutations
- Rainbow triangles in three-colored graphs
- A new lower bound based on Gromov's method of selecting heavily covered points
- Improving bounds on packing densities of 4-point permutations
- Closing in on Hill's conjecture