On the convexified Sauer-Shelah theorem

DOI10.1006/jctb.1996.1736zbMath0868.05051OpenAlexW2082435672MaRDI QIDQ1354724

Michel Talagrand, Stanislaw J. Szarek

Publication date: 3 June 1997

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

Full work available at URL: https://doi.org/10.1006/jctb.1996.1736

zbMATH Keywords

combinatorial complexitySauer-Shelah theorem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal set theory (05D05)

Related Items (2)

Theory of Classification: a Survey of Some Recent Advances ⋮ Integer cells in convex sets

Cites Work

• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• A Remark on the Szarek–Talagrand Theorem
• A proportional Dvoretzky-Rogers factorization result
• Unnamed Item
• Unnamed Item

This page was built for publication: On the convexified Sauer-Shelah theorem