The sharp threshold for maximum-size sum-free subsets in even-order abelian groups
Combinatorics
2015-06-03 v2 Group Theory
Probability
Abstract
We study sum-free sets in sparse random subsets of even order abelian groups. In particular, we determine the sharp threshold for the following property: the largest such set is contained in some maximum-size sum-free subset of the group. This theorem extends recent work of Balogh, Morris and Samotij, who resolved the case G = Z_{2n}, and who obtained a weaker threshold (up to a constant factor) in general.
Cite
@article{arxiv.1310.3236,
title = {The sharp threshold for maximum-size sum-free subsets in even-order abelian groups},
author = {Neal Bushaw and Maurício Collares Neto and Robert Morris and Paul Smith},
journal= {arXiv preprint arXiv:1310.3236},
year = {2015}
}
Comments
29 pages, revised version, to appear in Combinatorics, Probability & Computing