Article ID Journal Published Year Pages File Type
4654413 European Journal of Combinatorics 2009 6 Pages PDF
Abstract

We show that the number of maximal sum-free subsets of {1,2,…,n}{1,2,…,n} is at most 23n/8+o(n)23n/8+o(n). We also show that 20.406n+o(n)20.406n+o(n) is an upper bound on the number of maximal product-free subsets of any group of order nn.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Bounds on the number of maximal sum-free sets
Authors
,