Maximum number of almost similar triangles in the plane

From MaRDI portal
Publication:2144458




Abstract: A triangle T is varepsilon-similar to another triangle T if their angles pairwise differ by at most varepsilon. Given a triangle T, varepsilon>0 and ninmathbbN, B'ar'any and F"uredi asked to determine the maximum number of triangles h(n,T,varepsilon) being varepsilon-similar to T in a planar point set of size n. We show that for almost all triangles T there exists varepsilon=varepsilon(T)>0 such that h(n,T,varepsilon)=n3/24(1+o(1)). Exploring connections to hypergraph Tur'an problems, we use flag algebras and stability techniques for the proof.





Describes a project that uses

Uses Software





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)