The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups

DOI10.1017/S0963548314000595zbMATH Open1372.11030arXiv1310.3236MaRDI QIDQ5364249FDOQ5364249

Authors: Neal Bushaw, Maurício Collares Neto, Robert Morris, Paul Smith 

Publication date: 4 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1310.3236

Recommendations

• ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP
• On maximal sum-free sets in abelian groups
• Maximal sum-free sets in finite abelian groups
• Maximal sum-free sets in finite abelian groups
• The largest \((k,\ell)\)-sum-free sets in compact Abelian groups
• On the maximum cardinality of a \((k,l)\)-sum-free set in an abelian group
• Asymptotics of the number of sum-free sets in abelian groups of even order.
• Sharp bound on the number of maximal sum-free subsets of integers
• The maximum size of \((k,l)\)-sum-free sets in cyclic groups
• A sharp bound on the number of maximal sum-free sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Ramsey theory (05D10) Arithmetic combinatorics; higher degree uniformity (11B30) Abelian groups (20K99)

Cites Work

• Title not available (Why is that?)
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• A structure theorem for Boolean functions with small total influences
• Hypergraph containers
• Independent sets in hypergraphs
• Arithmetic progressions of length three in subsets of a random set
• Counting sum-free sets in abelian groups
• Sharp thresholds of graph properties, and the $k$-sat problem
• Threshold functions
• Mantel's theorem for random graphs
• Rado Partition Theorem for Random Subsets of Integers
• THE CAMERON–ERDOS CONJECTURE
• Threshold Functions for Ramsey Properties
• Sum-free sets in Abelian groups.
• The tail of the hypergeometric distribution
• Large triangle-free subgraphs in graphs without \(K_ 4\)
• On Schur properties of random subsets of integers
• Ramsey properties of random discrete structures
• A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
• Extremal subgraphs of random graphs
• Stability results for random discrete structures
• Sum-free sets in abelian groups
• On the method of typical bounded differences
• Maximal sum-free sets of elements of finite groups
• Asymptotics of the number of sum-free sets in abelian groups of even order.
• Title not available (Why is that?)
• A refinement of the Cameron-Erdős conjecture
• The typical structure of sparse \(K_{r+1}\)-free graphs
• Random sum-free subsets of abelian groups

Cited In (3)

• Random sum-free subsets of abelian groups
• On the stability of the Erdős-Ko-Rado theorem
• On the method of typical bounded differences

This page was built for publication: The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364249)