Uniform set systems with small VC-dimension
From MaRDI portal
Cites work
- A combinatorial problem; stability and order for models and theories in infinitary languages
- Counterexample to the Frankl-Pach conjecture for uniform, dense families
- Families of finite sets with minimum shadows
- scientific article; zbMATH DE number 3869331 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false
- Improved bounds for the sunflower lemma
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- Note on sunflowers
- On disjointly representable sets
- On the density of families of sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the VC-dimension of uniform hypergraphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Stability for the Complete Intersection Theorem, and the Forbidden Intersection Problem of Erd\H{o}s and S\'os
- Sunflowers in set systems of bounded dimension
- The Frankl-pach upper bound is not tight for any uniformity
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
This page was built for publication: Uniform set systems with small VC-dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932103)