Small Maximal Sum-Free Sets
MICHAEL C. GIUDICI, Sarah B. Hart · The Electronic Journal of Combinatorics · 2009
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2009
Abstract
Let $G$ be a group and $S$ a non-empty subset of $G$. If $ab \notin S$ for any $a, b \in S$, then $S$ is called sum-free. We show that if $S$ is maximal by inclusion and no proper subset generates $\langle S\rangle$ then $|S|\leq 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 \in S$ such that $a \notin \langle S \setminus \{a\}\rangle$.
Open the resolved locator · 10.37236/148
Metadata licence: OpenAlex metadata (CC0)