The VC dimension of k-uniform random hypergraphs

B. Ycart, J. Ratsaby

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


A set of vertices is shattered in a hypergraph if any of its subsets is obtained as the intersection of an edge with the set. The VC dimension is the size of the largest shattered subset. Under the binomial model of k-uniform random hypergraphs, the threshold function for the VC dimension to be larger than a given integer is obtained. The same is done for the testing dimension, which is the largest integer d such that all sets of cardinality d are shattered.

Original languageEnglish
Pages (from-to)564-572
Number of pages9
JournalRandom Structures and Algorithms
Issue number4
StatePublished - Jul 2007
Externally publishedYes


  • Random hypergraph
  • Testing dimension
  • Threshold
  • Vapnik-Chervonenkis


Dive into the research topics of 'The VC dimension of k-uniform random hypergraphs'. Together they form a unique fingerprint.

Cite this