Two-Part and k-Sperner Families: New Proofs Using Permutations

DOI10.1137/S0895480104443588zbMath1089.05072OpenAlexW2131045899MaRDI QIDQ5470775

Péter L. Erdős, Zoltan Fueredi

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480104443588

zbMATH Keywords

extremal problemspermutation methodSperner families

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (9)

A note on tilted Sperner families with patterns ⋮ Chain intersecting families ⋮ Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks ⋮ A tour of \(M\)-part \(L\)-Sperner families ⋮ Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals ⋮ Unnamed Item ⋮ A classification of the structures of some Sperner families and superimposed codes ⋮ Old and new applications of Katona's circle ⋮ Abelian groups yield many large families for the diamond problem

This page was built for publication: Two-Part and k-Sperner Families: New Proofs Using Permutations