The sunflower conjecture

can the number of k size sets required for the existence of a sunflower of r sets be bounded by an exponential function in k for every fixed r>2?

Open the “Combinatorics” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)