Author:
Cohen G.,Körner J.,Simonyi G.
Reference14 articles.
1. N. Alon “Explicit construction of exponential sized families of k-independent sets”, Discrete Math 58 (1986), pp. 191–193.
2. L. Lovàsz “On the Shannon capacity of a graph”, IEEE Trans, on Information Theory, IT-25 n° 1, pp. 1–7 (1979).
3. W. Haemers “On some problems of Lovksz concerning the Shannon capacity of a graph”, IEEE Trans, on Information Theory, IT-25 nc2, pp. 231–323 (1979).
4. D. Blackwell, L. Breiman, A.J. Thomasian “The capacity of a class of channels”, Annals of Math. Stat. 30 (1959), pp. 1229–1241.
5. R.L. Dobrushin “Optimal information transfer over a channel with unknown parameters”, (in Russian) Radiotechn i Electron. 4 (1959), pp. 1951–1956.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Connector Families of Graphs;Graphs and Combinatorics;2013-07-30
2. On the Conjunctive Capacity of Graphs;Lecture Notes in Computer Science;2013
3. Cross-intersecting couples of graphs;Journal of Graph Theory;2007
4. On the capacity of boolean graph formulæ;Graphs and Combinatorics;1995-03
5. Sperner capacities;Graphs and Combinatorics;1993-03