Bounds on the Number of Maximal Sum-Free Sets

DOI10.1016/j.endm.2007.07.055zbMath1341.05010OpenAlexW2005884353MaRDI QIDQ3503488

Guy Wolfovitz

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.055

zbMATH Keywords

asymptotic enumerationcombinatorial number theorymaximal sum-free sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Asymptotic enumeration (05A16)

Cites Work

• Independent sets in quasi-regular graphs
• Independent sets in regular graphs and sum-free subsets of finite groups
• On the number of maximal sum-free sets
• Notes on Sum-Free and Related Sets
• THE CAMERON–ERDOS CONJECTURE
• The Number of Maximal Independent Sets in Triangle-Free Graphs

This page was built for publication: Bounds on the Number of Maximal Sum-Free Sets