Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals

DOI10.1007/978-3-642-36899-8_17zbMath1378.05016arXiv1207.2646OpenAlexW1591767575MaRDI QIDQ4915246

Éva Czabarka, László A. Székely, Harout Aydinian

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.2646

zbMATH Keywords

packingextremal set theorytransversalmultisetmixed orthogonal arraySperner theorypacking arrayBLYM inequality

Mathematics Subject Classification ID

Extremal set theory (05D05) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (1)

Abelian groups yield many large families for the diamond problem

Cites Work

• Unnamed Item
• Unnamed Item
• A tour of \(M\)-part \(L\)-Sperner families
• Extremal hypergraph problems and convex hulls
• Convex hulls of more-part Sperner families
• Orthogonal arrays with variable numbers of symbols
• Orthogonal arrays. Theory and applications
• On the construction of mixed orthogonal arrays of strength two
• Ramsey-Sperner theory
• Logarithmic order of free distributive lattice
• Two-Part and k-Sperner Families: New Proofs Using Permutations
• On generalized graphs
• A short proof of Sperner's lemma
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• A Generalization of a Theorem due to MacNeish
• Orthogonal Arrays of Index Unity
• On a lemma of Littlewood and Offord

This page was built for publication: Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals