Year: 2025
Type: article
Abstract: Given natural numbers $$k\le s\le n$$ k ≤ s ≤ n , we ask: what is the minimal VC-dimension of a family $$\mathcal {F}$$ 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.
Source: Graphs and Combinatorics
Authors: George Peterzil, Johanna Steinmeyer
Institution: Hebrew University of Jerusalem
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,190
Award: G3929982605
OpenAlex ID: W4410144728