Vela

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_37aec80d874a0239
vela reproduce examples/erdos-problems

status

solved

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 3dcf880d39b813581007281e7e27f89e7f932428720605b7ff5d8ca981b7bc00

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.