TY - JOUR

T1 - TURÁN NUMBERS OF SUNFLOWERS

AU - Bradač, Domagoj

AU - Bucić, Matija

AU - Sudakov, Benny

N1 - Funding Information:
Received by the editors October 25, 2021, and, in revised form, April 15, 2022, and May 24, 2022. 2020 Mathematics Subject Classification. Primary 05C65, 05D05, 05D40, 05C51; Secondary 90C27, 11A07. This research was supported in part by SNSF grant 200021 196965.
Publisher Copyright:
©2022 American Mathematical Society.

PY - 2023/3/1

Y1 - 2023/3/1

N2 - A collection of distinct sets is called a sunflower if the intersection of any pair of sets equals the common intersection of all the sets. Sunflowers are fundamental objects in extremal set theory with relations and applications to many other areas of mathematics as well as to theoretical computer science. A central problem in the area due to Erdős and Rado from 1960 asks for the minimum number of sets of size r needed to guarantee the existence of a sunflower of a given size. Despite a lot of recent attention including a polymath project and some amazing breakthroughs, even the asymptotic answer remains unknown. We study a related problem first posed by Duke and Erdős in 1977 which requires that in addition the intersection size of the desired sunflower be fixed. This question is perhaps even more natural from a graph theoretic perspective since it asks for the Turán number of a hypergraph made by the sunflower consisting of k edges, each of size r and with common intersection of size t. For a fixed size of the sunflower k, the order of magnitude of the answer has been determined by Frankl and Füredi. In the 1980’s, with certain applications in mind, Chung, Erdős and Graham considered what happens if one allows k, the size of the desired sunflower, to grow with the size of the ground set. In the three uniform case, r = 3, the correct dependence on the size of the sunflower has been determined by Duke and Erdős and independently by Frankl and in the four uniform case by Bucić, Draganić, Sudakov and Tran. We resolve this problem for any uniformity, by determining up to a constant factor the n-vertex Turán number of a sunflower of arbitrary uniformity r, common intersection size t and with the size of the sunflower k allowed to grow with n.

AB - A collection of distinct sets is called a sunflower if the intersection of any pair of sets equals the common intersection of all the sets. Sunflowers are fundamental objects in extremal set theory with relations and applications to many other areas of mathematics as well as to theoretical computer science. A central problem in the area due to Erdős and Rado from 1960 asks for the minimum number of sets of size r needed to guarantee the existence of a sunflower of a given size. Despite a lot of recent attention including a polymath project and some amazing breakthroughs, even the asymptotic answer remains unknown. We study a related problem first posed by Duke and Erdős in 1977 which requires that in addition the intersection size of the desired sunflower be fixed. This question is perhaps even more natural from a graph theoretic perspective since it asks for the Turán number of a hypergraph made by the sunflower consisting of k edges, each of size r and with common intersection of size t. For a fixed size of the sunflower k, the order of magnitude of the answer has been determined by Frankl and Füredi. In the 1980’s, with certain applications in mind, Chung, Erdős and Graham considered what happens if one allows k, the size of the desired sunflower, to grow with the size of the ground set. In the three uniform case, r = 3, the correct dependence on the size of the sunflower has been determined by Duke and Erdős and independently by Frankl and in the four uniform case by Bucić, Draganić, Sudakov and Tran. We resolve this problem for any uniformity, by determining up to a constant factor the n-vertex Turán number of a sunflower of arbitrary uniformity r, common intersection size t and with the size of the sunflower k allowed to grow with n.

UR - http://www.scopus.com/inward/record.url?scp=85146444801&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85146444801&partnerID=8YFLogxK

U2 - 10.1090/proc/16160

DO - 10.1090/proc/16160

M3 - Article

AN - SCOPUS:85146444801

SN - 0002-9939

VL - 151

SP - 961

EP - 975

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

IS - 3

ER -