A sharp bound on the number of maximal sum-free sets

DOI10.1016/j.endm.2015.06.010zbMath1346.05207OpenAlexW2180866856MaRDI QIDQ322191

Maryam Sharifzadeh, Andrew Treglown, József Balogh, Hong Liu

Publication date: 14 October 2016

Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/26306660/eurocombPURE.pdf

zbMATH Keywords

sum-free setsindependent setscontainer method

Mathematics Subject Classification ID

Hypergraphs (05C65) Other combinatorial number theory (11B75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• Unnamed Item
• Unnamed Item
• Hypergraph containers
• Bounds on the number of maximal sum-free sets
• A Szemerédi-type regularity lemma in abelian groups, with applications
• On the number of maximal sum-free sets
• The number of the maximal triangle-free graphs
• The number of maximal sum-free subsets of integers
• THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS
• Notes on Sum-Free and Related Sets
• THE CAMERON–ERDOS CONJECTURE
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• Independent sets in hypergraphs
• On cliques in graphs

This page was built for publication: A sharp bound on the number of maximal sum-free sets