On the Shannon capacity of probabilistic graphs

DOI10.1006/jctb.1993.1015zbMath0793.05129OpenAlexW1971612822MaRDI QIDQ1325239

Katalin Marton

Publication date: 7 August 1994

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

Full work available at URL: https://doi.org/10.1006/jctb.1993.1015

zbMATH Keywords

polyhedraprobability distributiongraph entropyShannon capacitygraph productsantiblocking pairsprobabilistic graphs

Mathematics Subject Classification ID

Combinatorial probability (60C05) Graph theory (05C99) Information theory (general) (94A15)

Related Items (7)

Information theoretic parameters of noncommutative graphs and convex corners ⋮ Asymptotic values of the Hall-ratio for graph powers ⋮ Forbiddance and capacity ⋮ An axiomatic duality framework for the theta body and related convex corners ⋮ On the capacity of Boolean graph formulæ ⋮ Probabilistic refinement of the asymptotic spectrum of graphs ⋮ Entropy splitting for antiblocking corners and perfect graphs

This page was built for publication: On the Shannon capacity of probabilistic graphs