We show that the number of maximal sum-free subsets of {1, 2, ..., n} is at most 23 n / 8 + o (n). We also show that 20.406 n + o (n) is an upper bound on the number of maximal product-free subsets of any group of order n. © 2009 Elsevier Ltd. All rights reserved.
CITATION STYLE
Wolfovitz, G. (2009). Bounds on the number of maximal sum-free sets. European Journal of Combinatorics, 30(7), 1718–1723. https://doi.org/10.1016/j.ejc.2009.03.015
Mendeley helps you to discover research relevant for your work.