On the VC-dimension of uniform hypergraphs

DOI10.1007/S10801-006-0025-4MaRDI QIDQ857750zbMATH OpenOpenAlexFDO

Authors Dhruv Mubayi, Yi Zhao

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

zbMATH Keywords

Extremal problemsTrace

Mathematics Subject Classification ID

Extremal set theory (05D05)

Recommendations

• The VC dimension of k‐uniform random hypergraphs
• On vertex independence number of uniform hypergraphs
• On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
• On the capacity of uniform hypergraphs
• The uniformity space of hypergraphs and its applications
• ON THE NUMBER OF CYCLES OF GRAPHS AND VC-DIMENSION
• Erdős-Hajnal conjecture for graphs with bounded VC-dimension
• Erdos-Hajnal conjecture for graphs with bounded VC-dimension
• The VC-dimension of graphs with respect to k-connected subgraphs
• The VC dimension of \(k\)-fold union

Cites work

• scientific article; zbMATH DE number 3895787 (Why is no real title available?)
• scientific article; zbMATH DE number 736296 (Why is no real title available?)
• A combinatorial problem; stability and order for models and theories in infinitary languages
• Counterexample to the Frankl-Pach conjecture for uniform, dense families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection Theorems for Systems of Sets
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• On disjointly representable sets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the density of families of sets
• Order shattering and Wilson's theorem

Cited in

(11)

• On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• Hitting Set for hypergraphs of low VC-dimension
• An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• The VC-dimension of set systems defined by graphs
• Multivalued generalizations of the Frankl-Pach theorem
• Linear algebra methods for Forbidden configurations
• The VC dimension of k‐uniform random hypergraphs
• A uniform version of a theorem by Dvir and Moran
• Forbidding complete hypergraphs as traces

This page was built for publication: On the VC-dimension of uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857750)