Improves the Frankl–Pach upper bound on maximum size of (d+1)-uniform VC-dimension-d families to binom(n-1,d) + O_d(n^{d-1-1/(4d-2)}), disproves the Erdős–Frankl–Pach conjecture, and proposes a refined version.
Induced subgraph density. VI. Bounded VC- dimension,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
Graphs of bounded VC-dimension have sub-linear twin-width, shown via a new contraction tool on neighborhood partitions, plus tighter bounds for interval graphs.
citing papers explorer
-
Uniform set systems with small VC-dimension
Improves the Frankl–Pach upper bound on maximum size of (d+1)-uniform VC-dimension-d families to binom(n-1,d) + O_d(n^{d-1-1/(4d-2)}), disproves the Erdős–Frankl–Pach conjecture, and proposes a refined version.