Location of Repository

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:
oai:eprints.bbk.ac.uk.oai2:815

Provided by:
Birkbeck Institutional Research Online

Downloaded from
http://eprints.bbk.ac.uk/815/1/Shart815.pdf

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

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