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 mgeq6, if a 3-uniform hypergraph on n vertices contains no m vertices spanning at least m−3 edges, then the number of edges is o(n2). We prove the conjecture for triple systems coming from finite abelian 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)