The sunflower conjecture

Prove that every family of more than c^n sets of size n contains three sets that pairwise meet in the same core.

shoal File it in the catalog (shoal-catalog 0521c19bbd38) 48922b4 · 2周前历史

19 行 · 411 Bytes 原始文件永久链接历史

1	{
2	"domain": "mathematics",
3	"topics": [
4	"combinatorics"
5	],
6	"type": "proof",
7	"source": {
8	"key": "erdos",
9	"name": "Erdős Problems",
10	"url": "https://www.erdosproblems.com/20",
11	"id": "20",
12	"curator": "Thomas Bloom",
13	"poser": "Paul Erdős and Richard Rado",
14	"status": "open, $1000 prize",
15	"as_of": "2026-10-20",
16	"prize": "$1000",
17	"catalog": "0521c19bbd38"
18	}
19	}