{"quality_controlled":"1","article_type":"original","language":[{"iso":"eng"}],"month":"03","publication_identifier":{"issn":["0097-3165"],"eissn":["1096-0899"]},"oa_version":"Published Version","publication":"Journal of Combinatorial Theory, Series A","publisher":"Elsevier","author":[{"last_name":"Frankl","first_name":"Peter","full_name":"Frankl, Peter"},{"last_name":"Pach","first_name":"János","full_name":"Pach, János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4"},{"full_name":"Pálvölgyi, Dömötör","first_name":"Dömötör","last_name":"Pálvölgyi"}],"main_file_link":[{"url":"https://doi.org/10.1016/j.jcta.2024.105889","open_access":"1"}],"volume":206,"intvolume":"       206","title":"Odd-sunflowers","scopus_import":"1","_id":"15247","citation":{"short":"P. Frankl, J. Pach, D. Pálvölgyi, Journal of Combinatorial Theory, Series A 206 (2024).","chicago":"Frankl, Peter, János Pach, and Dömötör Pálvölgyi. “Odd-Sunflowers.” <i>Journal of Combinatorial Theory, Series A</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.jcta.2024.105889\">https://doi.org/10.1016/j.jcta.2024.105889</a>.","ista":"Frankl P, Pach J, Pálvölgyi D. 2024. Odd-sunflowers. Journal of Combinatorial Theory, Series A. 206(8), 105889.","ama":"Frankl P, Pach J, Pálvölgyi D. Odd-sunflowers. <i>Journal of Combinatorial Theory, Series A</i>. 2024;206(8). doi:<a href=\"https://doi.org/10.1016/j.jcta.2024.105889\">10.1016/j.jcta.2024.105889</a>","ieee":"P. Frankl, J. Pach, and D. Pálvölgyi, “Odd-sunflowers,” <i>Journal of Combinatorial Theory, Series A</i>, vol. 206, no. 8. Elsevier, 2024.","apa":"Frankl, P., Pach, J., &#38; Pálvölgyi, D. (2024). Odd-sunflowers. <i>Journal of Combinatorial Theory, Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcta.2024.105889\">https://doi.org/10.1016/j.jcta.2024.105889</a>","mla":"Frankl, Peter, et al. “Odd-Sunflowers.” <i>Journal of Combinatorial Theory, Series A</i>, vol. 206, no. 8, 105889, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.jcta.2024.105889\">10.1016/j.jcta.2024.105889</a>."},"publication_status":"epub_ahead","date_published":"2024-03-20T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"20","article_processing_charge":"No","date_updated":"2024-04-02T09:51:45Z","year":"2024","doi":"10.1016/j.jcta.2024.105889","status":"public","article_number":"105889","oa":1,"type":"journal_article","acknowledgement":"We are grateful to Balázs Keszegh, and to the members of the Miklós Schweitzer Competition committee of 2022 for valuable discussions, and Shira Zerbib for pointing out several important mathematical typos.","external_id":{"arxiv":["2310.16701"]},"issue":"8","department":[{"_id":"HeEd"}],"date_created":"2024-03-31T22:01:11Z","abstract":[{"lang":"eng","text":"Extending the notion of sunflowers, we call a family of at least two sets an odd-sunflower if every element of the underlying set is contained in an odd number of sets or in none of them. It follows from the Erdős–Szemerédi conjecture, recently proved by Naslund and Sawin, that there is a constant <2 such that every family of subsets of an n-element set that contains no odd-sunflower consists of at most n sets. We construct such families of size at least 1.5021n. We also characterize minimal odd-sunflowers of triples."}]}