English

A Note On The Cross-Sperner Families

Combinatorics 2023-07-12 v2

Abstract

Let (F,G)(\mathcal{F},\mathcal{G}) be a pair of families of [n][n], where [n]={1,2,...,n}[n]=\{1,2,...,n\}. If A⊄BA\not\subset B and B⊄AB\not\subset A hold for all AFA\in\mathcal{F} and BGB\in\mathcal{G}, then (F,G)(\mathcal{F},\mathcal{G}) is called a Cross-Sperner pair. P. Frankl and Jian Wang introduced the extremal problem that m(n)=max{I(F,G):F,G2[n] are crossm(n)={\rm{max}}\{|\mathcal{I}(\mathcal{F},\mathcal{G})|:\mathcal{F},\mathcal{G}\subset2^{[n]}~{\rm{are~cross}}-sperner}{\rm{sperner}}\}, where I(F,G)={AB:AF,BG}\mathcal{I}(\mathcal{F},\mathcal{G})=\{A\cap B:A\in\mathcal{F},B\in\mathcal{G}\}. In this note, we prove that m(n)=2n2n22n2+1m(n)=2^n-2^{\lfloor\frac{n}{2}\rfloor}-2^{\lceil\frac{n}{2}\rceil}+1 for all n>1n>1. This solves an open problem proposed by P. Frankl and Jian Wang.

Keywords

Cite

@article{arxiv.2307.03531,
  title  = {A Note On The Cross-Sperner Families},
  author = {Junyao Pan},
  journal= {arXiv preprint arXiv:2307.03531},
  year   = {2023}
}

Comments

We solve an open problem proposed by P. Frankl and Jian Wang

R2 v1 2026-06-28T11:24:29.126Z