Counterexamples to the Balogh-Linz-Patkós Conjecture
Combinatorics
2026-07-03 v1
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\'os (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\'os conjecture for all and satisfying .
Keywords
Cite
@article{arxiv.2607.03026,
title = {Counterexamples to the Balogh-Linz-Patkós Conjecture},
author = {Jia-Bao Yang and Leilei Zhang},
journal= {arXiv preprint arXiv:2607.03026},
year = {2026}
}
Comments
8 pages, Comments welcome!