A lower bound for families of Natarajan dimension \(d\)

DOI10.1006/jcta.2000.3160zbMath0971.05106OpenAlexW1992739560WikidataQ61635611 ScholiaQ61635611MaRDI QIDQ5940311

Ji{ří} Matoušek, Paul Fischer

Publication date: 21 October 2001

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.2000.3160

zbMATH Keywords

hypergraphtransversalsextremal set theoryNatarajan dimension

Mathematics Subject Classification ID

Extremal set theory (05D05) Ramsey theory (05D10)

Related Items (2)

Minimal paths and cycles in set systems ⋮ Planar polynomials and an extremal problem of Fischer and Matoušek

Cites Work

• Supersaturated graphs and hypergraphs
• \(\epsilon\)-nets and simplex range queries
• Discrepancy and approximations for bounded VC-dimension
• A generalization of Sauer's lemma
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Learnability and the Vapnik-Chervonenkis dimension
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On a problem of K. Zarankiewicz
• Unnamed Item
• Unnamed Item

This page was built for publication: A lower bound for families of Natarajan dimension \(d\)