Repeated communication and Ramsey graphs
Authors:
- N. AlonNAN. Alon
- A. OrlitskyAOA. Orlitsky
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (5) , 1276-1289
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Three results on interactive communicationIEEE Transactions on Information Theory, 1993
- Worst-case interactive communication. I. Two messages are almost optimalIEEE Transactions on Information Theory, 1990
- Monochromatic directed walks in arc-colored directed graphsActa Mathematica Hungarica, 1987
- Kneser's conjecture, chromatic number, and homotopyJournal of Combinatorial Theory, Series A, 1978
- The zero-error side information problem and chromatic numbers (Corresp.)IEEE Transactions on Information Theory, 1976
- Hide and Seek, Data Storage, and EntropyThe Annals of Mathematical Statistics, 1971
- Ramsey bounds for graph productsPacific Journal of Mathematics, 1971
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956
- Some remarks on the theory of graphsBulletin of the American Mathematical Society, 1947
- Ein Satz ber Untermengen einer endlichen MengeMathematische Zeitschrift, 1928