{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:05:46Z","timestamp":1758823546549},"reference-count":33,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2015,1,9]],"date-time":"2015-01-09T00:00:00Z","timestamp":1420761600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2015,7]]},"abstract":"<jats:p>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<jats:italic>G<\/jats:italic>= \u2124<jats:sub>2<jats:italic>n<\/jats:italic><\/jats:sub>, and who obtained a weaker threshold (up to a constant factor) in general.<\/jats:p>","DOI":"10.1017\/s0963548314000595","type":"journal-article","created":{"date-parts":[[2015,1,9]],"date-time":"2015-01-09T04:18:22Z","timestamp":1420777102000},"page":"609-640","source":"Crossref","is-referenced-by-count":2,"title":["The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups"],"prefix":"10.1017","volume":"24","author":[{"given":"NEAL","family":"BUSHAW","sequence":"first","affiliation":[]},{"given":"MAUR\u00cdCIO","family":"COLLARES NETO","sequence":"additional","affiliation":[]},{"given":"ROBERT","family":"MORRIS","sequence":"additional","affiliation":[]},{"given":"PAUL","family":"SMITH","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2015,1,9]]},"reference":[{"key":"S0963548314000595_ref33","unstructured":"Warnke L. On the method of typical bounded differences. To appear in CPC."},{"key":"S0963548314000595_ref25","doi-asserted-by":"publisher","DOI":"10.2307\/2152833"},{"key":"S0963548314000595_ref28","first-page":"454","article-title":"Asymptotics of the number of sum-free sets in abelian groups of even order (in Russian)","volume":"383","author":"Sapozhenko","year":"2002","journal-title":"Dokl. Akad. Nauk."},{"key":"S0963548314000595_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02773386"},{"key":"S0963548314000595_ref21","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2012.176.1.9"},{"key":"S0963548314000595_ref19","doi-asserted-by":"publisher","DOI":"10.1112\/S0024609304003650"},{"key":"S0963548314000595_ref32","first-page":"114","article-title":"\u00dcber die Kongruenz xm + ym \u2261 zm (mod p)","volume":"25","author":"Schur","year":"1916","journal-title":"Jahresber. Deutsche Math.-Verein."},{"key":"S0963548314000595_ref17","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20352"},{"key":"S0963548314000595_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788087"},{"key":"S0963548314000595_ref12","doi-asserted-by":"crossref","unstructured":"DeMarco B. and Kahn J. Mantel's theorem for random graphs. Random Struct. Alg., to appear.","DOI":"10.1002\/rsa.20535"},{"key":"S0963548314000595_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-013-0071-2"},{"key":"S0963548314000595_ref2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/pdt033"},{"key":"S0963548314000595_ref23","doi-asserted-by":"publisher","DOI":"10.4064\/aa-75-2-133-163"},{"key":"S0963548314000595_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-013-0067-y"},{"key":"S0963548314000595_ref13","doi-asserted-by":"publisher","DOI":"10.3792\/pja\/1195520891"},{"key":"S0963548314000595_ref27","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20477"},{"key":"S0963548314000595_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90084-0"},{"key":"S0963548314000595_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579198"},{"key":"S0963548314000595_ref26","doi-asserted-by":"publisher","DOI":"10.1112\/S0024611597000178"},{"key":"S0963548314000595_ref30","unstructured":"Saxton D. and Thomason A. Hypergraph containers. Submitted."},{"key":"S0963548314000595_ref22","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718"},{"key":"S0963548314000595_ref4","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331"},{"key":"S0963548314000595_ref16","doi-asserted-by":"crossref","unstructured":"Friedgut E. , R\u00f6dl V. , Ruci\u0144ski A. and Tetali P. (2006) A Sharp Threshold for Random Graphs with a Monochromatic Triangle in Every Edge Coloring, Vol. 179 of Memoirs of the American Mathematical Society.","DOI":"10.1090\/memo\/0845"},{"key":"S0963548314000595_ref5","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140511"},{"key":"S0963548314000595_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF02785363"},{"key":"S0963548314000595_ref7","doi-asserted-by":"crossref","unstructured":"Balogh J. , Morris R. and Samotij W. Independent sets in hypergraphs. J. Amer. Math. Soc., to appear.","DOI":"10.1090\/S0894-0347-2014-00816-X"},{"key":"S0963548314000595_ref29","first-page":"749","article-title":"The Cameron\u2013Erd\u0151s conjecture (in Russian)","volume":"393","author":"Sapozhenko","year":"2003","journal-title":"Dokl. Akad. Nauk."},{"key":"S0963548314000595_ref11","unstructured":"Conlon D. and Gowers W. T. Combinatorial theorems in sparse random sets. Submitted."},{"key":"S0963548314000595_ref8","doi-asserted-by":"crossref","unstructured":"Balogh J. , Morris R. , Samotij W. and Warnke L. The typical structure of sparse K r+1-free graphs. Trans. Amer. Math. Soc., to appear.","DOI":"10.1090\/tran\/6552"},{"key":"S0963548314000595_ref31","unstructured":"Schacht M. Extremal results for random discrete structures. Submitted."},{"key":"S0963548314000595_ref15","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-99-00305-7"},{"key":"S0963548314000595_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983917.003"},{"key":"S0963548314000595_ref18","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1996.0155"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548314000595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T09:20:23Z","timestamp":1566206423000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548314000595\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,9]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["S0963548314000595"],"URL":"https:\/\/doi.org\/10.1017\/s0963548314000595","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,9]]}}}