A structural generalization of the Ramsey theorem
HTML articles powered by AMS MathViewer
- by Jaroslav Nešetřil and Vojtěch Rödl PDF
- Bull. Amer. Math. Soc. 83 (1977), 127-128
References
- Jaroslav Ne et il and Vojtěch Rödl, The Ramsey property for graphs with forbidden complete subgraphs, J. Combinatorial Theory Ser. B 20 (1976), no. 3, 243–249. MR 412004, DOI 10.1016/0095-8956(76)90015-0
- Jaroslav Ne et il and Vojtěch Rödl, Partitions of finite relational and set systems, J. Combinatorial Theory Ser. A 22 (1977), no. 3, 289–312. MR 437351, DOI 10.1016/0097-3165(77)90004-8 3. F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. 30 (1930), 264-286.
Additional Information
- Journal: Bull. Amer. Math. Soc. 83 (1977), 127-128
- MSC (1970): Primary 05A99; Secondary 04A20, 02H05
- DOI: https://doi.org/10.1090/S0002-9904-1977-14212-2
- MathSciNet review: 0422035