Set Systems with Covering Properties and Low VC-Dimension
Abstract
Given natural numbers k ≤ s ≤ n, we ask: what is the minimal VC-dimension of a family F of s-subsets of [n] that covers all k-subsets of [n]? We first show that for sufficiently large n this number is always k, and construct families which give a lower bound for the actual growth of this stabilization point.
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.