Maximum hitting for n sufficiently large
Abstract
For a left-compressed intersecting family contained in [n](r) and a set X contained in [n], let (X) = A in : A intersect X is non-empty. Borg asked: for which X is |(X)| maximised by taking to be all r-sets containing the element 1? We determine exactly which X have this property, for n sufficiently large depending on r.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.