A sharp bound on the number of maximal sum-free sets
From MaRDI portal
(Redirected from Publication:322191)
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
Cites work
- scientific article; zbMATH DE number 4137896 (Why is no real title available?)
- scientific article; zbMATH DE number 1315262 (Why is no real title available?)
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Bounds on the number of maximal sum-free sets
- Hypergraph containers
- Independent sets in hypergraphs
- Notes on Sum-Free and Related Sets
- On cliques in graphs
- On the number of maximal sum-free sets
- THE CAMERON–ERDOS CONJECTURE
- The Number of Maximal Independent Sets in Triangle-Free Graphs
- The number of maximal sum-free subsets of integers
- The number of the maximal triangle-free graphs
- The typical structure of maximal triangle-free graphs
Cited in
(4)
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)