paper

Uniform Set Systems with Uniform Witnesses

arXiv:2602.17459

Abstract

Frankl--Pach and Erdős conjectured that any -uniform set family with VC-dimension at most has size at most when is sufficiently large. Ahlswede and Khachatrian showed that the conjecture is false by giving a counterexample of size . For a set family , the condition that its VC-dimension is at most can be reformulated as follows: for any , there exists a set such that for all . In this direction, the first author, Xu, Yip, and Zhang conjectured that the bound holds if we further assume that for every and for some fixed . The case is exactly the Erdős--Ko--Rado theorem, and the cases were proved in the paper by the first author, Xu, Yip, and Zhang. In this short note, we show that the conjecture holds when , and the maximal constructions are stars. Moreover, we construct non-star set families of size satisfying the condition for , which suggests that the problem is substantially different in these cases.

11 pages, included new example

Uniform Set Systems with Uniform Witnesses · wovepaper