Geodesic
Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs
Czechoslovak Mathematical Journal, Tome 29 (1979) no. 2, pp. 202-218
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1979.101598
Classification : 05C65 
@article{10_21136_CMJ_1979_101598,
     author = {Ne\v{s}et\v{r}il, Jaroslav and R\"odl, Vojt\v{e}ch},
     title = {Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {202--218},
     year = {1979},
     volume = {29},
     number = {2},
     doi = {10.21136/CMJ.1979.101598},
     mrnumber = {529509},
     zbl = {0432.05039},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1979.101598/}
}
TY  - JOUR
AU  - Nešetřil, Jaroslav
AU  - Rödl, Vojtěch
TI  - Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs
JO  - Czechoslovak Mathematical Journal
PY  - 1979
SP  - 202
EP  - 218
VL  - 29
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1979.101598/
DO  - 10.21136/CMJ.1979.101598
LA  - en
ID  - 10_21136_CMJ_1979_101598
ER  - 
%0 Journal Article
%A Nešetřil, Jaroslav
%A Rödl, Vojtěch
%T Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs
%J Czechoslovak Mathematical Journal
%D 1979
%P 202-218
%V 29
%N 2
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1979.101598/
%R 10.21136/CMJ.1979.101598
%G en
%F 10_21136_CMJ_1979_101598
Nešetřil, Jaroslav; Rödl, Vojtěch. Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs. Czechoslovak Mathematical Journal, Tome 29 (1979) no. 2, pp. 202-218. doi: 10.21136/CMJ.1979.101598

[0] J. Folkman: Graphs with monochromatic complete subgraphs in every edge coloring. SIAM J. Applied Math. 18 (1970), 19-29. | DOI | MR | Zbl

[1] R. L. Graham B. L. Rotschild: Some recent development in Ramsey theory. Mathematical Centre Tracts 56 (1974), 61-76. | MR

[2] 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

[3] J. Nešetřil V. Rödl: A Ramsey graph without triangles exists for every graph without triangles. Coll. Math. Soc. Janos Bolyai 10, North Holland Publ. Co. (1975), Amsterdam, 1127-1132. | MR

[4] J. Nešetřil V. Rödl: Ramsey property of graphs with forbidden complete subgraphs. J. Comb. Th. В 20 (1976), 243-249. | DOI | MR

[5] J. Nešetřil, V, Rödl: Partitions of vertices. Comment. Math. Univ. Carol., 17,1 (1976), 85 - 95. | MR

[6] J. Nešetřil V. Rödl: Partitions of finite relational and set systems. J. Comb. Th. A. 22 (1977), 289-312. | DOI | MR

[7] F. P. Ramsey: On a problem of formal logic. Proc. London. Math. Soc. 30 (1930), 264-286. | DOI

Cité par Sources :