erdős #21
Let be minimal such that there is an intersecting family of sets of size (so for all ) with such that any set with is disjoint from at least one .Is it true that
Worked, still open.
combinatorics · solved · prize $500 · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problems