Previous |  Up |  Next

Article

Title: Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs (English)
Author: Nešetřil, Jaroslav
Author: Rödl, Vojtěch
Language: English
Journal: Czechoslovak Mathematical Journal
ISSN: 0011-4642 (print)
ISSN: 1572-9141 (online)
Volume: 29
Issue: 2
Year: 1979
Pages: 202-218
Summary lang: Russian
.
Category: math
.
MSC: 05C65
idZBL: Zbl 0432.05039
idMR: MR529509
DOI: 10.21136/CMJ.1979.101598
.
Date available: 2008-06-09T14:33:20Z
Last updated: 2020-07-28
Stable URL: http://hdl.handle.net/10338.dmlcz/101598
.
Reference: [0] J. Folkman: Graphs with monochromatic complete subgraphs in every edge coloring.SIAM J. Applied Math. 18 (1970), 19-29. Zbl 0193.53103, MR 0268080, 10.1137/0118004
Reference: [1] R. L. Graham B. L. Rotschild: Some recent development in Ramsey theory.Mathematical Centre Tracts 56 (1974), 61-76. MR 0373948
Reference: [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 0409259
Reference: [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 0392695
Reference: [4] J. Nešetřil V. Rödl: Ramsey property of graphs with forbidden complete subgraphs.J. Comb. Th. В 20 (1976), 243-249. MR 0412004, 10.1016/0095-8956(76)90015-0
Reference: [5] J. Nešetřil, V, Rödl: Partitions of vertices.Comment. Math. Univ. Carol., 17,1 (1976), 85 - 95. MR 0412044
Reference: [6] J. Nešetřil V. Rödl: Partitions of finite relational and set systems.J. Comb. Th. A. 22 (1977), 289-312. MR 0437351, 10.1016/0097-3165(77)90004-8
Reference: [7] F. P. Ramsey: On a problem of formal logic.Proc. London. Math. Soc. 30 (1930), 264-286. 10.1112/plms/s2-30.1.264
.

Files

Files Size Format View
CzechMathJ_29-1979-2_6.pdf 1.437Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo