Is the sunflower conjecture true?
Basic
6
Ṁ532031
72%
chance
1D
1W
1M
ALL
A set of sets W is called a sunflower if the pairwise intersections of all sets in W are the same. That is, there is some set S such that, for every distinct A,B ∈ W, A∩B = S. This includes the case where S is the empty set (so W is a set of disjoint sets).
Let f(k,r) be the largest number n such that there is a set U of n sets, each of cardinality k or less, and that U has no r-element subset that is a sunflower. It is a theorem that a largest such n always exists for any natural numbers k and r.
The Erdos-Rado sunflower conjecture states that for every r>2, there is some constant C(r) depending only on r, such that f(k,r) ≤ C(r)^k for all k.
This question is managed and resolved by Manifold.
Get
1,000
and3.00
Related questions
Related questions
Is Haborth's Conjecture true?
70% chance
Is Hadwiger's conjecture true?
58% chance
Is the Unique Games Conjecture true?
65% chance
Is Schanuel's conjecture true?
78% chance
Is Goodman's Conjecture true?
71% chance
Is Beal's conjecture true?
60% chance
Is the Hadamard conjecture true?
84% chance
Is Szymanski's conjecture true?
81% chance
Is the Hodge conjecture true?
80% chance
Is Rudin's conjecture true?
69% chance