On the VC-dimension of uniform hypergraphs
From MaRDI portal
Publication:857750
DOI10.1007/s10801-006-0025-4zbMath1106.05096OpenAlexW2162057776MaRDI QIDQ857750
Publication date: 5 January 2007
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-006-0025-4
Related Items (5)
Unavoidable subhypergraphs: \(\mathbf a\)-clusters ⋮ Linear algebra methods for Forbidden configurations ⋮ MULTIVALUED GENERALIZATIONS OF THE FRANKL–PACH THEOREM ⋮ Forbidding complete hypergraphs as traces ⋮ Unavoidable subhypergraphs: a-clusters
Cites Work
- Unnamed Item
- Unnamed Item
- On disjointly representable sets
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- Counterexample to the Frankl-Pach conjecture for uniform, dense families
- Order shattering and Wilson's theorem
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
This page was built for publication: On the VC-dimension of uniform hypergraphs
