Geodesic
On Ramsey graphs without cycles of short odd lengths
Commentationes Mathematicae Universitatis Carolinae, Tome 20 (1979) no. 3, pp. 565-582 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05A17, 05C15, 05C38, 05C55 
@article{CMUC_1979_20_3_a13,
     author = {Ne\v{s}et\v{r}il, Jaroslav and R\"odl, Vojt\v{e}ch},
     title = {On {Ramsey} graphs without cycles of short odd lengths},
     journal = {Commentationes Mathematicae Universitatis Carolinae},
     pages = {565--582},
     year = {1979},
     volume = {20},
     number = {3},
     mrnumber = {550457},
     zbl = {0425.05025},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMUC_1979_20_3_a13/}
}
TY  - JOUR
AU  - Nešetřil, Jaroslav
AU  - Rödl, Vojtěch
TI  - On Ramsey graphs without cycles of short odd lengths
JO  - Commentationes Mathematicae Universitatis Carolinae
PY  - 1979
SP  - 565
EP  - 582
VL  - 20
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/CMUC_1979_20_3_a13/
LA  - en
ID  - CMUC_1979_20_3_a13
ER  - 
%0 Journal Article
%A Nešetřil, Jaroslav
%A Rödl, Vojtěch
%T On Ramsey graphs without cycles of short odd lengths
%J Commentationes Mathematicae Universitatis Carolinae
%D 1979
%P 565-582
%V 20
%N 3
%U http://geodesic.mathdoc.fr/item/CMUC_1979_20_3_a13/
%G en
%F CMUC_1979_20_3_a13
Nešetřil, Jaroslav; Rödl, Vojtěch. On Ramsey graphs without cycles of short odd lengths. Commentationes Mathematicae Universitatis Carolinae, Tome 20 (1979) no. 3, pp. 565-582. http://geodesic.mathdoc.fr/item/CMUC_1979_20_3_a13/

[1] Colloquium of finite and infinite set theory. Keszthely, Hungary, 10. Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam, 1975.

[2] P. ERDÖS: Graph theory and probability. Canad. J. Math. 11 (1959), 34-38. | MR

[3] P. ERDÖS: Problems and results of finite and infinite graphs. Recent advances in graph theory, Academia Praha (1975), 183-190. | MR

[4] L. LOVÁSZ: On chromatic number of finite set-systems. Acta Math. Acad. Sci. Hunger. 19 (1968), 59-67. | MR

[5] J. NEŠETŘIL V. RÖDL: A simple proof of the Galvin-Ramsey property of finite graphs and a dimension of a graph. Discrete Math. 23, 1 (1978), 49-56. | MR

[6] J. NEŠETŘIL V. RÖDL: Partitions of vertices. Comment. Math. Univ. Carolinae 17 (1976), 85-95. | MR

[7] J. NEŠETŘIL V. RÖDL: Type theory of partition properties of graphs. Recent advances in graph theory, Academia Praha (1975), 405-412. | MR

[8] J. NEŠETŘIL V. RÖDL: Partitions of subgraphs. Recent advances in graph theory, Academia Praha (1975), 413-423. | MR

[9] J. NEŠETŘIL V. RÖDL: 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. | MR

[10] V. RÖDL: A generalization of the Ramsey theorem. in: Graphs, hyper graphs and block systems, Zielona Gora (1976), 211-220.

[11] H. WALTHER H. J. VOSS: Über Kreise in Graphen. VEB Deutscher Verlag der Wissenschaften, Berlin, 1974.

[12] F. HARARY: Graph Theory. Addison-Wesley, Reading, Mass., 1969. | MR | Zbl