| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652943 | Electronic Notes in Discrete Mathematics | 2007 | 5 Pages |
Abstract
We show that the number of maximal sum-free subsets of {1,2,…,n} is at most 23n/8+o(n). We also show that 20.406n+o(n) is an upper bound on the number of maximal product-free subsets of any group of order n.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
