Notes on Sum-Free and Related Sets
From MaRDI portal
Publication:4243072
DOI10.1017/S0963548398003435zbMATH Open0927.11004OpenAlexW2139279621WikidataQ105687205 ScholiaQ105687205MaRDI QIDQ4243072FDOQ4243072
Authors: Peter J. Cameron, P. Erdős 
Publication date: 8 August 1999
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548398003435
Recommendations
Cited In (21)
- On the regular sum-free sets
- The number of maximal sum-free subsets of integers
- Beyond sum-free sets in the natural numbers
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On the Number of Sum-Free Sets
- Bounds on the Number of Maximal Sum-Free Sets
- On the complexity of finding and counting solution-free sets of integers
- On the maximal density of sum-free sets
- A characterization of elementary abelian 2-groups
- On solution-free sets of integers
- Title not available (Why is that?)
- A sharp bound on the number of maximal sum-free sets
- Groups with few maximal sum-free sets
- On maximal sum-free sets in abelian groups
- Følner sequences and sum-free sets
- Bounds on the number of maximal sum-free sets
- Almost Odd Random Sum-Free Sets
- Title not available (Why is that?)
- Enumerating solution-free sets in the integers
- On sets free of sumsets with summands of prescribed size
- Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice
This page was built for publication: Notes on Sum-Free and Related Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243072)
