A Note On The Cross-Sperner Families
Abstract
Let (F,G) be a pair of families of [n], where [n]=\1,2,...,n\. If A⊂ B and B⊂ A hold for all A∈F and B∈G, then (F,G) is called a Cross-Sperner pair. P. Frankl and Jian Wang introduced the extremal problem that m(n)=max\|I(F,G)|:F,G⊂2[n]~are~cross-sperner\, where I(F,G)=\A B:A∈F,B∈G\. In this note, we prove that m(n)=2n-2n2-2n2+1 for all n>1. This solves an open problem proposed by P. Frankl and Jian Wang.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.