One-inclusion hypergraph density revisited

DOI10.1016/J.IPL.2010.03.002zbMath1197.68063OpenAlexW2054166359MaRDI QIDQ991799

Hans Ulrich Simon, Balázs Szörényi

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.03.002

zbMATH Keywords

combinatorial problemspseudo-dimensionmistake boundgraph-dimensionone-inclusion hypergraph

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Hypergraphs (05C65)

Cites Work

• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• A generalization of Sauer's lemma
• Shifting: one-inclusion mistake bounds and sample compression
• On the density of families of sets

This page was built for publication: One-inclusion hypergraph density revisited