A Sperner-type theorem and qualitative independence

DOI10.1016/0097-3165(92)90100-9zbMath0758.05095OpenAlexW2082637671MaRDI QIDQ1185884

Gábor Simonyi, János Körner

Publication date: 28 June 1992

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(92)90100-9

zbMATH Keywords

extremal set problemqualitatively independent partitionSperner-type theoremzero-error capacity problem

Mathematics Subject Classification ID

Partitions of sets (05A18) Extremal set theory (05D05) Other combinatorial set theory (03E05)

Related Items (15)

Different capacities of a digraph ⋮ Sperner capacities ⋮ Capacities: From information theory to extremal set theory ⋮ On quorum systems for group resources allocation ⋮ On the extremal combinatorics of the Hamming space ⋮ Strong qualitative independence. ⋮ Forbiddance and capacity ⋮ Rényi 100, quantitative and qualitative (in)dependence ⋮ The Sperner capacity of linear and nonlinear codes for the cyclic triangle ⋮ Qualitative independence and Sperner problems for directed graphs ⋮ Graph-intersecting set systems and LYM inequalities ⋮ On the capacity of Boolean graph formulæ ⋮ Connection between conjunctive capacity and structural properties of graphs ⋮ Local chromatic number and Sperner capacity ⋮ A generalization of the AZ identity

Cites Work

• On the maximum number of qualitative independent partitions
• On generalized graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Sperner-type theorem and qualitative independence