paper

Counterexamples to the Balogh-Linz-Patkós Conjecture

arXiv:2607.03026

Abstract

A set system is called -intersecting if for every pair of sets A set system is -Sperner if it does not contain a chain of length . Balogh, Linz and Patkós (Combinatorial Theory, 2023) conjectured an extremal result for -intersecting -Sperner families when is odd. In this note we give an explicit construction that is -intersecting and -Sperner, and whose size exceeds that of the conjectured fixed-star construction for infinitely many values of . Consequently, we disprove the Balogh-Linz-Patkós conjecture for all and satisfying .

8 pages, Comments welcome!

Counterexamples to the Balogh-Linz-Patkós Conjecture · wovepaper