Qualitative independence and Sperner problems for directed graphs

DOI10.1016/0097-3165(92)90016-NzbMath0765.05007OpenAlexW2064830370MaRDI QIDQ1199993

Luisa Gargano, Ugo Vaccaro, János Körner

Publication date: 17 January 1993

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)90016-n

zbMATH Keywords

directed graphsShannon capacitySperner familyqualitative independence\(k\)-partitionsSperner problems

Mathematics Subject Classification ID

Partitions of sets (05A18) Extremal set theory (05D05) Directed graphs (digraphs), tournaments (05C20)

Related Items (16)

Different capacities of a digraph ⋮ Capacities: From information theory to extremal set theory ⋮ On quorum systems for group resources allocation ⋮ On the extremal combinatorics of the Hamming space ⋮ On colorful edge triples in edge-colored complete graphs ⋮ Locating and detecting arrays for interaction faults ⋮ Multiplicity-free permutation representations of the symmetric group. ⋮ Rényi 100, quantitative and qualitative (in)dependence ⋮ Unnamed Item ⋮ The Sperner capacity of linear and nonlinear codes for the cyclic triangle ⋮ Unnamed Item ⋮ Algorithms for finding maximum transitive subtournaments ⋮ On the capacity of Boolean graph formulæ ⋮ Generalized covering designs and clique coverings ⋮ Local chromatic number and Sperner capacity ⋮ Capacities of graphs and \(2\)-matchings

Cites Work

• On the maximum number of qualitative independent partitions
• A Sperner-type theorem and qualitative independence
• On the Shannon capacity of a graph
• On generalized graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Qualitative independence and Sperner problems for directed graphs