A sharp bound on the number of maximal sum-free sets
From MaRDI portal
Publication:322191
DOI10.1016/J.ENDM.2015.06.010zbMATH Open1346.05207OpenAlexW2180866856MaRDI QIDQ322191FDOQ322191
Maryam Sharifzadeh, Hong Liu, Andrew Treglown, József Balogh
Publication date: 14 October 2016
Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/26306660/eurocombPURE.pdf
Recommendations
- Bounds on the number of maximal sum-free sets
- Bounds on the Number of Maximal Sum-Free Sets
- Sharp bound on the number of maximal sum-free subsets of integers
- Sharp estimates for the number of sum-free sets
- On the number of maximal sum-free sets
- On the maximal density of sum-free sets
- On the number of sum-free sets
- On the Number of Sum-Free Sets
- scientific article; zbMATH DE number 409908
- The number of maximal sum-free subsets of integers
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65) Other combinatorial number theory (11B75) Arithmetic combinatorics; higher degree uniformity (11B30)
Cites Work
- On cliques in graphs
- Hypergraph containers
- Independent sets in hypergraphs
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- THE CAMERON–ERDOS CONJECTURE
- The Number of Maximal Independent Sets in Triangle-Free Graphs
Cited In (2)
This page was built for publication: A sharp bound on the number of maximal sum-free sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322191)
