Exact results on traces of sets
Abstract
For non-negative integers n, m, a and b, we write ( n,m ) → ( a,b ) if for every family F⊂eq 2[n] with |F|≥slant m there is an a-element set T⊂eq [n] such that | F T | ≥slant b, where F T=\ F T : F ∈ F \. A longstanding problem in extremal set theory asks to determine m(s)=n→ +∞m(n,s)n, where m(n,s) denotes the maximum integer m such that ( n,m ) → ( n-1,m-s ) holds for non-negatives n and s. In this paper, we establish the exact value of m(2d-1-c) for all 1≤slant c≤slant d whenever d≥slant 50, thereby solving an open problem posed by Piga and Sch\"ulke. To be precise, we show that m(n,2d-1-c)=2d-cdn for 1≤ c≤ d-1 and d n, and m(n,2d-1-d)=2d-d-0.5dn for 2d n holds for d≥ 50. Furthermore, we provide a proof that confirms a conjecture of Frankl and Watanabe from 1994, demonstrating that m(11)=5.3.
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.