Skip to main content
Article thumbnail
Location of Repository

Small maximal sum-free sets

By M. Guidici and Sarah Hart


Let G be a group and S a non-empty subset of G. If ab∉S for any a,b∈S, then S is called sum-free. We show that if S is maximal by inclusion and no proper subset generates ⟨S⟩ then |S|≤2. We determine all groups with a maximal (by inclusion) sum-free set of size at most 2 and all of size 3 where there exists a∈S such that a∉⟨S∖{a}⟩

Topics: ems
Publisher: The Electronic Journal of Combinatorics
Year: 2009
OAI identifier:

Suggested articles


  1. (1972). Combinatorics: Room squares, sum-free sets, Hadamard matrices, doi
  2. (1991). General Galois geometries, Oxford Mathematical Monographs, The Clarendon Press,
  3. (1974). Group Ramsey theory, doi
  4. (1996). Humphreys A Course in Group Theory,
  5. (1997). Large product-free subsets of finite groups, doi
  6. (2005). On the number of product-free sets in groups of even order, doi
  7. (1988). On the number of sets of integers with various properties, Number theory
  8. (1998). Product-free subsets of groups, doi
  9. (2008). Quasirandom groups, doi
  10. (1985). Sidon sets in groups and induced subgraphs of Cayley graphs, doi
  11. (2005). Sum-free sets in abelian groups, doi
  12. (2004). The Cameron-Erdo˝s conjecture, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.