Title of article
Bounds on the Number of Maximal Sum-Free Sets
Author/Authors
Wolfovitz، نويسنده , , Guy، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
5
From page
321
To page
325
Abstract
We show that the number of maximal sum-free subsets of { 1 , 2 , … , n } is at most 2 3 n / 8 + o ( n ) . We also show that 2 0.406 n + o ( n ) is an upper bound on the number of maximal product-free subsets of any group of order n.
Keywords
combinatorial number theory , maximal sum-free sets , asymptotic enumeration
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2007
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454733
Link To Document