On the VC-dimension of uniform hypergraphs
type: Item
instance of: scholarly article
title: On the VC-dimension of uniform hypergraphs
zbMATH Open document ID: 1106.05096
author: Dhruv Mubayi
author: Yi Zhao
published in: Journal of Algebraic Combinatorics
publication date: 2007-01-05T00:00:00Z
Mathematics Subject Classification ID: 05D05
zbMATH DE Number: 5081876
zbMATH Keywords: Trace
zbMATH Keywords: Extremal problems
MaRDI profile type: Publication
full work available at URL: s10801-006-0025-4
OpenAlex ID: W2162057776
cites work: Counterexample to the Frankl-Pach conjecture for uniform, dense families
cites work: Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
cites work: Q3675085
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Intersection Theorems for Systems of Sets
cites work: On disjointly representable sets
cites work: Order shattering and Wilson's theorem
cites work: Q4326640
cites work: On the density of families of sets
cites work: A combinatorial problem; stability and order for models and theories in infinitary languages
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
DOI: 10.1007/S10801-006-0025-4
Recommended article: The VC dimension of k‐uniform random hypergraphs
Recommended article: On vertex independence number of uniform hypergraphs
Recommended article: On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
Recommended article: On the capacity of uniform hypergraphs
Recommended article: The uniformity space of hypergraphs and its applications
Recommended article: ON THE NUMBER OF CYCLES OF GRAPHS AND VC-DIMENSION
Recommended article: Erdős-Hajnal conjecture for graphs with bounded VC-dimension
Recommended article: Erdos-Hajnal conjecture for graphs with bounded VC-dimension
Recommended article: The VC-dimension of graphs with respect to \(k\)-connected subgraphs
Recommended article: The VC dimension of \(k\)-fold union
description: scientific article; zbMATH DE number 5081876