[1] |
Erdös, P.; Hajnal, A., On chromatic number of graphs and set systems, Acta Math. Acad. Sci. Hungar., 17, 61-99 (1966) · Zbl 0151.33701 |
[2] |
Erdös, P., Problems and results on finite and infinite graphs, (Recent Advances in Graph Theory (1975), Academia: Academia Prague), 183-192 · Zbl 0347.05116 |
[3] |
Colloquia Mathematica Societatis János Bolyai (1973), Infinite and Finite Sets: Infinite and Finite Sets Keszthely, Hungary |
[4] |
Folkman, J., Graphs with monochromatic complete subgraphs in every edge coloring, SIAM J. Appl. Math., 18, 19-29 (1970) · Zbl 0193.53103 |
[5] |
Graham, R. L.; Leeb, K.; Rothschild, B. L., Ramsey’s theorem for a class of categories, Advances in Math., 8, 417-433 (1972) · Zbl 0243.18011 |
[6] |
Graham, R. L.; Rothschild, B. L., Some recent developments in Ramsey theory, Mathematical Centre Tracts (Amsterdam), 57, 61-67 (1974) · Zbl 0303.05002 |
[7] |
Leeb, K., Vorlesungen über Pascaltheorie (1973), preprint |
[8] |
McLane, S., Categories for a working mathematician, (Graduate Texts in Mathematics, Vol. 5 (1972), Springer-Verlag: Springer-Verlag Berlin/Heidelberg/New York) · JFM 61.0050.01 |
[9] |
Nešetřil, J.; Rödl, V., Ramsey property of graphs with forbidden complete subgraphs, J. Combinatorial Theory (B), 20, 243-249 (1976) · Zbl 0329.05115 |
[10] |
Nešetřil, J.; Rödl, V., Type theory of partition problems of graphs, (Recent Advances in Graph Theory (1975), Academia: Academia Prague), 405-412 · Zbl 0325.05120 |
[11] |
Nešetřil, J.; Rödl, V., Partitions of subgraphs, (Recent Advances in Graph Theory (1975), Academia: Academia Prague), 413-423 · Zbl 0325.05121 |
[12] |
Ramsey, F. P., On a problem of formal logic, (Proc. London Math. Soc., 30 (1930)), 264-286 · JFM 55.0032.04 |
[13] |
Rödl, V., A generalization of Ramsey theorem, (Graphs, Hypergraphs and Block Systems (1976)), 211-220, Zielona Gora |