Capacities of graphs and \(2\)-matchings

DOI10.1016/S0012-365X(97)00188-XzbMath0956.05084MaRDI QIDQ1584259

R. Smith

Publication date: 2 November 2000

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

zbMATH Keywords

probability distributionsSperner capacityShannon capacity2-matchingindependent partitionscapacity formula

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Entropy of symmetric graphs ⋮ Symmetric graphs with respect to graph entropy ⋮ Connection between conjunctive capacity and structural properties of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• Qualitative independence and Sperner problems for directed graphs
• Capacities: From information theory to extremal set theory
• Sperner capacities
• Minimum node covers and 2-bicritical graphs
• Path Partitions in Directed Graphs
• The Factorization of Linear Graphs

This page was built for publication: Capacities of graphs and \(2\)-matchings