Capacities of graphs and \(2\)-matchings
type: Item
instance of: scholarly article
title: Capacities of graphs and \(2\)-matchings
zbMATH Open document ID: 0956.05084
DOI: 10.1016/S0012-365X(97)00188-X
author: R. Smith
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1524859
zbMATH Keywords: Sperner capacity
zbMATH Keywords: Shannon capacity
zbMATH Keywords: probability distributions
zbMATH Keywords: capacity formula
zbMATH Keywords: 2-matching
zbMATH Keywords: independent partitions
MaRDI profile type: Publication
cites work: Path Partitions in Directed Graphs
cites work: Q3977587
cites work: Q3686615
cites work: Qualitative independence and Sperner problems for directed graphs
cites work: Sperner capacities
cites work: Capacities: From information theory to extremal set theory
cites work: Matching theory
cites work: Minimum node covers and 2-bicritical graphs
cites work: The Factorization of Linear Graphs
Recommended article: On the capacity of graphs
Recommended article: On the Conjunctive Capacity of Graphs
Recommended article: Q4255352
Recommended article: Intersection number and capacities of graphs
Recommended article: On the capacity of digraphs
Recommended article: Relative capacity and dimension of graphs
Recommended article: The $\rho $ -Capacity of a Graph
Recommended article: Chromatic capacities of graphs and hypergraphs
Recommended article: Q4875680
Recommended article: Complexes of graphs with bounded matching size
description: scientific article; zbMATH DE number 1524859