Counterexamples to the Balogh-Linz-Patkós Conjecture

Abstract

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

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…