Maximum number of almost similar triangles in the plane

DOI10.1016/J.COMGEO.2022.101880zbMATH Open1491.05137arXiv2101.10304OpenAlexW4221078986WikidataQ114195529 ScholiaQ114195529MaRDI QIDQ2144458FDOQ2144458

Authors: József Balogh, Felix Christian Clemen, Bernard Lidický 

Publication date: 13 June 2022

Published in: Computational Geometry (Search for Journal in Brave)

Abstract: A triangle $T^{\prime }$ 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)=n^3/24(1+o(1))$. Exploring connections to hypergraph Tur'an problems, we use flag algebras and stability techniques for the proof.

Full work available at URL: https://arxiv.org/abs/2101.10304

Recommendations

• Almost similar configurations
• Similar simplices in a \(d\)-dimensional point set
• On the maximum number of isosceles right triangles in a finite point set
• Repeated angles in the plane and related problems
• On the maximum number of equilateral triangles. I

zbMATH Keywords

extremal hypergraphsflag algebrassimilar triangles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Grassmannians, Schubert varieties, flag manifolds (14M15) Enumeration in graph theory (05C30) Hypergraphs (05C65)

Cites Work

• CSDP, A C library for semidefinite programming
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• Flag algebras
• Rainbow triangles in three-colored graphs
• On the Distribution of Values of Angles Determined by Coplanar Points
• A new lower bound based on Gromov's method of selecting heavily covered points
• Minimum Number of Monotone Subsequences of Length 4 in Permutations
• Minimum number of edges that occur in odd cycles
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• Strong forms of stability from flag algebra calculations
• Improving bounds on packing densities of 4-point permutations
• Almost similar configurations
• Closing in on Hill's Conjecture

Cited In (1)

• Tree-Degenerate Graphs and Nested Dependent Random Choice

Uses Software

• CSDP
• Flagmatic

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)