Largest Sperner families with bounded VC-dimension
math.CO
Submitted: 2026-11-04
Updated: 2026-11-04
Comments: 14 pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: A conjecture of Frankl proposed in the 1980s states that for n at least2d, every Sperner family F 2[n] of VC-dimension at most d has at most d members.
Terminology
Abstract
A conjecture of Frankl proposed in the 1980s states that for n at least2d, every Sperner family F 2[n] of VC-dimension at most d has at most d members. We prove this conjecture for every fixed d and large n, and show that equality holds only when F is d or n-d.
Sources
- Interpolating chromatic and homomorphism thresholds
- Beyond chromatic threshold via the $(p,q)$-theorem, and a sharp blow-up phenomenon
- A Single-Exponential Erd\H{o}s--Hajnal Bound for Graphs of Bounded VC-Dimension
- Beating the Ahlswede--Khachatrian bound for the Erd\H{o}s--Frankl--Pach problem
- Largest $3$-uniform set systems with VC-dimension $2$
- Maxmum Size of a Uniform Family with Bounded VC-dimension
- Recursive Lifting Beyond the Ahlswede--Khachatrian Construction
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality