The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős

DOI10.1007/BF02901123zbMath1041.94006WikidataQ123112648 ScholiaQ123112648MaRDI QIDQ1428861

Yusheng Li

Publication date: 18 May 2004

Published in: Chinese Science Bulletin (Search for Journal in Brave)

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Coding theorems (Shannon theory) (94A24)

Related Items (1)

On a diagonal conjecture for classical Ramsey numbers

Cites Work

• Unnamed Item
• Ramsey bounds for graph products
• A survey of bounds for classical Ramsey numbers
• Repeated communication and Ramsey graphs
• A problem of Schur and its generalizations

This page was built for publication: The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős