Vela

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

notary

vela reproduce examples/erdos-problems
  • packet.json · sha256 88b910f9c2a65eb52e6e3ac9cf3078aa5b3b90aec253169dda017d3fc2e19cfb

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.