On the Shannon capacity of probabilistic graphs
From MaRDI portal
Publication:1325239
DOI10.1006/JCTB.1993.1015zbMATH Open0793.05129OpenAlexW1971612822MaRDI QIDQ1325239FDOQ1325239
Authors: K. 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
Recommendations
graph productspolyhedraprobability distributionShannon capacitygraph entropyantiblocking pairsprobabilistic graphs
Cited In (20)
- The asymptotic spectrum of graphs and the Shannon capacity
- Asymptotic values of the Hall-ratio for graph powers
- Title not available (Why is that?)
- An Analogue of the Shannon Capacity of a Graph
- On the variance of Shannon products of graphs
- A note on counting very different sequences
- The Shannon capacity of a graph and the independence numbers of its powers
- Information theoretic parameters of noncommutative graphs and convex corners
- Redundancy of codes with graph constraints
- Lovász, vectors, graphs and codes
- Entropy splitting for antiblocking corners and perfect graphs
- On the capacity of uniform hypergraphs
- On the Shannon capacity of a graph
- On the normalized Shannon capacity of a union
- Forbiddance and capacity
- Probabilistic refinement of the asymptotic spectrum of graphs
- Networks, Matroids, and Non-Shannon Information Inequalities
- On the capacity of Boolean graph formulæ
- An axiomatic duality framework for the theta body and related convex corners
- Qualitative independence and Sperner problems for directed graphs
This page was built for publication: On the Shannon capacity of probabilistic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325239)
