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

DOI10.1017/S0305004119000203zbMath1472.05119arXiv1902.07614OpenAlexW2953855682WikidataQ123140898 ScholiaQ123140898MaRDI QIDQ4958663

Rajko Nenadov, Mykhaylo Tyomkyn, Benjamin Sudakov

Publication date: 14 September 2021

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Finite abelian groups (20K01)

Related Items (3)

Local-vs-global combinatorics ⋮ A new bound for the Brown-Erdős-Sós problem ⋮ A Ramsey variant of the Brown–Erdős–Sós conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new proof of the density Hales-Jewett theorem
• An extension of the Ruzsa-Szemerédi theorem
• On the existence of dense substructures in finite groups
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• An ergodic Szemerédi theorem for commuting transformations
• An isoperimetric inequality for planar triangulations
• A density version of the Hales-Jewett theorem
• The Brown-Erdős-Sós conjecture in finite abelian groups
• Density theorems and extremal hypergraph problems
• Hypergraph regularity and the multidimensional Szemerédi theorem
• On the existence of triangulated spheres in 3-graphs, and related problems
• A Simple Proof of the Density Hales–Jewett Theorem
• Embedding Incomplete Latin Squares
• On sets of integers containing k elements in arithmetic progression
• The (7, 4)-Conjecture in Finite Groups
• On Certain Sets of Integers

This page was built for publication: Proof of the Brown–Erdős–Sós conjecture in groups