Abstract
Almost 50 years ago Erdős and Purdy asked the following question: Given n points in the plane, how many triangles can be approximate congruent to equilateral triangles? They pointed out that by dividing the points evenly into three small clusters built around the three vertices of a fixed equilateral triangle, one gets at least \(\left\lfloor \frac{n}{3} \right\rfloor \cdot \left\lfloor \frac{n+1}{3} \right\rfloor \cdot \left\lfloor \frac{n+2}{3} \right\rfloor \) such approximate copies. In this paper we provide a matching upper bound and thereby answer their question. More generally, for every triangle T we determine the maximum number of approximate congruent triangles to T in a point set of size n. Parts of our proof are based on hypergraph Turán theory: for each point set in the plane and a triangle T, we construct a 3-uniform hypergraph \(\mathcal {H}=\mathcal {H}(T)\), which contains no hypergraph as a subgraph from a family of forbidden hypergraphs \(\mathcal {F}=\mathcal {F}(T)\). Our upper bound on the number of edges of \(\mathcal {H}\) will determine the maximum number of triangles that are approximate congruent to T.
Similar content being viewed by others
References
Ábrego, B.M., Fernández-Merchant, S.: On the maximum number of equilateral triangles. I. Discrete Comput. Geom. 23(1), 129–135 (2000)
Baber, R., Talbot, J.: Hypergraphs do jump. Comb. Probab. Comput. 20(2), 161–171 (2011)
Balogh, J., Clemen, F.C., Lidický, B.: Hypergraph Turán problems in \(\ell _2\)-norm. In: Surveys in Combinatorics 2022, volume 481 of London Mathematical Society Lecture Note Series, pp. 21–63. Cambridge University Press, Cambridge (2022)
Balogh, J., Clemen, F.C., Lidický, B.: Maximum number of almost similar triangles in the plane. Comput. Geom., 105/106:Paper No. 101880, 15 (2022)
Bárány, I., Füredi, Z.: Almost similar configurations. Bull. Hellenic Math. Soc. 63, 17–37 (2019)
Bollobás, B.: Three-graphs without two triples whose symmetric difference is contained in a third. Discrete Math. 8, 21–24 (1974)
Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)
Erdős, P., Kelly, L.M.: Elementary problems and solutions: solutions: E735. Am. Math. Mon. 54(4), 227–229 (1947). https://doi.org/10.2307/2304710
Erdős, P., Purdy, G.: Some extremal problems in geometry. III. In: Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1975), Congressus Numerantium, No. XIV, pp. 291–308. Utilitas Math., Winnipeg (1975)
Falgas-Ravry, V., Vaughan, E.R.: Applications of the semi-definite method to the Turán density problem for 3-graphs. Comb. Probab. Comput. 22(1), 21–54 (2013)
Frankl, P., Füredi, Z.: A new generalization of the Erdős-Ko-Rado theorem. Combinatorica 3(3–4), 341–349 (1983)
Frankl, P., Rödl, V.: Hypergraphs do not jump. Combinatorica 4(2–3), 149–159 (1984)
Keevash, P.: Hypergraph Turán problems. In: Surveys in Combinatorics 2011, volume 392 of London Mathematical Society Lecture Note Series, pp. 83–139. Cambridge University Press, Cambridge (2011)
Keevash, P., Mubayi, D.: Stability theorems for cancellative hypergraphs. J. Comb. Theory Ser. B 92(1), 163–175 (2004)
Pach, J.: Finite point configurations. In: Handbook of Discrete and Computational Geometry, 3rd edn, pp. 3–25. CRC, Boca Raton, FL (2017)
Pach, J., Pinchasi, R.: How many unit equilateral triangles can be generated by \(N\) points in convex position? Am. Math. Mon. 110(5), 400–406 (2003)
Razborov, A.A.: Flag algebras. J. Symb. Logic 72(4), 1239–1282 (2007)
Razborov, A.A.: On 3-hypergraphs with forbidden 4-vertex configurations. SIAM J. Discrete Math. 24(3), 946–963 (2010)
Shinohara, M.: Classification of three-distance sets in two dimensional Euclidean space. Eur. J. Comb. 25(7), 1039–1058 (2004)
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: János Pach
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Research is partially supported by NSF Grant DMS-1764123, NSF RTG grant DMS 1937241, Arnold O. Beckman Research Award (UIUC Campus Research Board RB 22000), and the Langan Scholar Fund (UIUC).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Balogh, J., Clemen, F.C. & Dumitrescu, A. Almost Congruent Triangles. Discrete Comput Geom (2024). https://doi.org/10.1007/s00454-023-00623-9
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00454-023-00623-9