erdős #722
Let and be sufficiently large in terms of and . Does there always exist a block design (or Steiner system with parameters ), provided the trivial necessary divisibility conditions are satisfied for every ?That is, can one find a family of many subsets of , all of size , such that any of size is contained in exactly one set in the family?
Worked, still open.
combinatorics · solved · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problems