The Brown-Erdős-Sós conjecture in finite abelian groups
From MaRDI portal
Publication:2309563
Abstract: The Brown-ErdH{o}s-S'{o}s conjecture, one of the central conjectures in extremal combinatorics, states that for any integer if a 3-uniform hypergraph on vertices contains no vertices spanning at least edges, then the number of edges is We prove the conjecture for triple systems coming from finite abelian groups.
Recommendations
Cites work
- scientific article; zbMATH DE number 981680 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 2086426 (Why is no real title available?)
- Large girth approximate Steiner triple systems
- On a conjecture of Erdős on locally sparse Steiner triple systems
- On sets of integers containing k elements in arithmetic progression
- On the existence of triangulated spheres in 3-graphs, and related problems
- The (7, 4)-Conjecture in Finite Groups
Cited in
(8)- A short proof of Erdős' conjecture for triple systems
- A new bound for the Brown-Erdős-Sós problem
- scientific article; zbMATH DE number 5831732 (Why is no real title available?)
- Proof of the Brown-Erdős-Sós conjecture in groups
- A note on the Brown-Erdős-Sós conjecture in groups
- A Ramsey variant of the Brown-Erdős-Sós conjecture
- On the structure of pointsets with many collinear triples
- On the existence of dense substructures in finite groups
This page was built for publication: The Brown-Erdős-Sós conjecture in finite abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2309563)