Skip to main content Accessibility help

Proof of the Brown–Erdős–Sós conjecture in groups



The conjecture of Brown, Erdős and Sós from 1973 states that, for any k ≥ 3, if a 3-uniform hypergraph H with n vertices does not contain a set of k +3 vertices spanning at least k edges then it has o(n2) edges. The case k = 3 of this conjecture is the celebrated (6, 3)-theorem of Ruzsa and Szemerédi which implies Roth’s theorem on 3-term arithmetic progressions in dense sets of integers. Solymosi observed that, in order to prove the conjecture, one can assume that H consists of triples (a, b, ab) of some finite quasigroup Γ. Since this problem remains open for all k ≥ 4, he further proposed to study triple systems coming from finite groups. In this case he proved that the conjecture holds also for k = 4. Here we completely resolve the Brown–Erdős–Sós conjecture for all finite groups and values of k. Moreover, we prove that the hypergraphs coming from groups contain sets of size $\Theta (\sqrt k )$ which span k edges. This is best possible and goes far beyond the conjecture.



Hide All

The first and the second author were supported in part by SNSF grant 200021-175573.

Supported in part by ERC Starting Grant 633509 and ERC Starting Grant 676632.



Hide All
[1]Ajtai, M. and Szemerédi, E.. Sets of lattice points that form no squares. Stud. Sci. Math. Hungar. 9 (1975), 911.
[2]Angel, O., Benjamini, I. and Horesh., N. An isoperimetric inequality for planar triangulations. Discrete Comput. Geom. (2018), 18.
[3]Brown, W., Erdős, P. and Sós., V. On the existence of triangulated spheres in 3-graphs, and related problems. Period. Math. Hungar. 3(3-4) (1973), 221228.
[4]Dodos, P., Kanellopoulos, V. and Tyros., K. A simple proof of the density Hales–Jewett theorem. Int. Math. Res. Not. (12) (2014), 33403352.
[5]Erdős, P., Frankl, P. and Rödl., V. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Combin., 2(1) (1986), 113121.
[6]Erdős, P. and Straus, E.. How abelian is a finite group? Linear Multilinear Algebra 3(4) (1976), 307312.
[7]Evans, T.. Embedding incomplete latin squares. Amer. Math. Monthly 67(10) (1960), 958961.
[8]Furstenberg, H. and Katznelson, Y.. An ergodic Szemerédi theorem for commuting transformations. J. Anal. Math. 34(1) (1978), 275291.
[9]Furstenberg, H. and Katznelson, Y.. A density version of the Hales–Jewett theorem. J. Anal. Math. 57(1) (1991), 64119.
[10]Gowers, W. T.. Hypergraph regularity and the multidimensional Szemerédi theorem. Ann. of Math. (2007), 897946.
[11]Harper, L. H.. Global Methods for Combinatorial Isoperimetric Problems. Camb. Stud. Adv. Math. (Cambridge University Press, 2004).
[12]Long, J.. A note on the Brown–Erdős–Sós conjecture in groups. Preprint (arXiv:1902.07693).
[13]Polymath, D.. A new proof of the density Hales–Jewett theorem. Ann. of Math. (2012), 12831327.
[14]Pyber, L.. How abelian is a finite group? In The Mathematics of Paul Erdős I, pages 372384 (Springer, 1997).
[15]Rödl, V., Schacht, M., Tengan, E. and Tokushige., N. Density theorems and extremal hypergraph problems. Israel J. Math. 152(1) (2006), 371380.
[16]Roth, K. F.. On certain sets of integers. J. Lond. Math. Soc. 1(1) (1953), 104109.
[17]Ruzsa, I. Z. and Szemerédi, E.. Triple systems with no six points carrying three triangles. Combinatorics (Keszthely, 1976), Coll. Math. Soc. J. Bolyai 18 (1978), 939945.
[18]Sárközy, G. N. and Selkow, S.. An extension of the Ruzsa–Szemerédi theorem. Combinatorica 25(1) (2004), 7784.
[19]Solymosi, J.. Note on a generalisation of Roth’s theorem. In Discrete Comput. Geom., pages 825827 (Springer, 2003).
[20]Solymosi, J.. The (7, 4)-conjecture in finite groups. Combin. Probab. Comput. 24(4) (2015), 680686.
[21]Solymosi, J. and Wong, C.. The Brown–Erdős–Sós conjecture in finite abelian groups. arXiv:1901.10631.
[22]Szemerédi, E.. On sets of integers containing no k elements in arithmetic progression. Acta Arith. 27 (1975), 199245. Collection of articles in memory of Juriĭ Vladimirovič Linnik.
[23]Wong, C.. On the existence of dense substructures in finite groups. arXiv:1902.07819.

MSC classification


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed