Alon, N., and Orlitsky, A. Repeated communication and Ramsey graphs. IEEE Trans. Inform. Theory 41, 5 (1995), 1276-1289. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On the Lovász number of Certain Circulant Graphs - Brimkov, Codenotti.. (1999) (Correct)
.... a lot of interest in the scientific community, because of the applications to communication issues, but also due to the connections with some central combinatorial and computational questions in graph theory, like computing the largest clique and finding the chromatic number of a graph (see [2, 3, 4, 6] for a sample of the wealth of different results and applications of #(G) and Theta(G) Despite a lot of work in the field, finding the explicit value of the theta function for interesting special classes of graphs is still an open problem . In this paper we present some results on the theta ....
N. Alon and A. Orlitsky. Repeated communication and Ramsey graphs, IEEE Trans. on Inf. Theory, 41 (1995), 1276--1289.
Ramsey Theory Applications - Vera Rosta Dept (Correct)
No context found.
Alon, N., and Orlitsky, A. Repeated communication and Ramsey graphs. IEEE Trans. Inform. Theory 41, 5 (1995), 1276-1289.
On the Lovász Number of Certain Circulant Graphs - Brimkov, Codenotti.. (2000) (Correct)
No context found.
Alon, N., Orlitsky, A.: Repeated Communication and Ramsey Graphs. IEEE Trans. on Inf. Theory, 41 (1995) 1276-1289
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC