Bounds on the Number of Maximal Sum-Free Sets

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2007 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Wolfovitz, G. (2007). Bounds on the Number of Maximal Sum-Free Sets. Electronic Notes in Discrete Mathematics, 29(SPEC. ISS.), 321–325. https://doi.org/10.1016/j.endm.2007.07.055

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free