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.
Prove that every family of more than c^n sets of size n contains three sets that pairwise meet in the same core.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.