Maximum number of almost similar triangles in the plane
From MaRDI portal
Publication:2144458
Abstract: A triangle is -similar to another triangle if their angles pairwise differ by at most . Given a triangle , and , B'ar'any and F"uredi 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'an problems, we use flag algebras and stability techniques for the proof.
Recommendations
Cites work
- A new lower bound based on Gromov's method of selecting heavily covered points
- Almost similar configurations
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- CSDP, A C library for semidefinite programming
- Closing in on Hill's conjecture
- Flag algebras
- Improving bounds on packing densities of 4-point permutations
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Minimum number of edges that occur in odd cycles
- On the Distribution of Values of Angles Determined by Coplanar Points
- Rainbow triangles in three-colored graphs
- Strong forms of stability from flag algebra calculations
This page was built for publication: Maximum number of almost similar triangles in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144458)