@article{105952, author = {Jaroslav Ne\v set\v ril and Vojt\v ech R\"odl}, title = {On Ramsey graphs without cycles of short odd lengths}, journal = {Commentationes Mathematicae Universitatis Carolinae}, volume = {020}, year = {1979}, pages = {565-582}, zbl = {0425.05025}, mrnumber = {550457}, language = {en}, url = {http://dml.mathdoc.fr/item/105952} }
Nešetřil, Jaroslav; Rödl, Vojtěch. On Ramsey graphs without cycles of short odd lengths. Commentationes Mathematicae Universitatis Carolinae, Tome 020 (1979) pp. 565-582. http://gdmltest.u-ga.fr/item/105952/
Colloquium of finite and infinite set theory, Keszthely, Hungary, 10. Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam, 1975. (1975)
Graph theory and probability, Canad. J. Math. 11 (1959), 34-38. (1959) | MR 0102081
Problems and results of finite and infinite graphs, Recent advances in graph theory, Academia Praha (1975), 183-190. (1975) | MR 0389669
On chromatic number of finite set-systems, Acta Math. Acad. Sci. Hunger. 19 (1968), 59-67. (1968) | MR 0220621
A simple proof of the Galvin-Ramsey property of finite graphs and a dimension of a graph, Discrete Math. 23, 1 (1978), 49-56. (1978) | MR 0523311
Partitions of vertices, Comment. Math. Univ. Carolinae 17 (1976), 85-95. (1976) | MR 0412044
Type theory of partition properties of graphs, Recent advances in graph theory, Academia Praha (1975), 405-412. (1975) | MR 0409259
Partitions of subgraphs, Recent advances in graph theory, Academia Praha (1975), 413-423. (1975) | MR 0429655
A Ramsey graph without triangles exists for any graph without triangles, Colloquium on finite and infinite set theory, 10. Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam (1975), 1127-1132. (1975) | MR 0392695
A generalization of the Ramsey theorem, in: Graphs, hyper graphs and block systems, Zielona Gora (1976), 211-220. (1976)
Über Kreise in Graphen, VEB Deutscher Verlag der Wissenschaften, Berlin, 1974. (1974)
Graph Theory, Addison-Wesley, Reading, Mass., 1969. (1969) | MR 0256911 | Zbl 0196.27202