Combinatorial partitions of finite posets and lattices —Ramsey lattices

P. Erdös andA. Hajnal,On chromatic number of graphs and set-systems, Acta Math. Acad. Sci. Hung.17 (1966), 61–99.

P.Erdös, J.Nešetřil and V.Rödl,Selectivity of hypergraphs, to appear in Proceedings of the V. Hungarian Comb. Colloquim.

R. Graham andB. Rothschild,Some recent developments in Ramsey theory, in:Combinatorics, eds. M. Hall, Jr. and J. H. van Lint, D. Reidel Publ. Co. Dordrecht-Boston (1975), 261–276.

A. Hales andR. I. Jewett,Regularity and positional games, Trans. Amer. Math. Soc.106 (1963), 222–229.

J.Ježek and J.Nešetřil,Ramsey varieties, to appear in European J. Combinatorics.

K.Leeb,Vorlesungen über Pascaltheorie, Erlangen 1973.

L. Lovász, On chromatic number of finite set systems, Acta Math. Acad. Sci. Hung. 19 (1968), 59–67.

J. Nešetřil andV. Rödl, Type theory of partition properties of graphs, in: Recent advances in Graph Theory, Academia, Prague (1975), 405–412.

J. Nešetřil andV. Rödl,Partitions of relational and set systems, J. Comb. Th. A22 (1977), 289–312.

J.Nešetřil and V.Rödl,Partition (Ramsey) theory — a survey, in: Coll. Math. Soc. János Bolyai, 18,Combinatorics, North Holland (1978), 759–792.

J.Nešetřil and V.Rödl,Partition theory and its applications, in B. Bollobás, ed.,Surveys of Combinatorics, London, Math. Sci. Lecture Notes, Ser.38 (1979), 96–156.

J. Nešetřil andV. Rödl,A short proof of the existence of highly chromatic graphs without short cycles, J. Comb. Th. B, 27,2 (1979), 225–227.

J. Nešetřil andV. Rödl,On a selective property of graphs and hypergraphs, in:Proceedings of the Cambridge Coll. 1977,Annals of Discrete Math. 3 (1978), 181–189.

H. J. Prömel andB. Voigt,Recent results in partition (Ramsey) theory for finite lattices, Discrete Math.35 (1981), 185–198.

F. P. Ramsey,On a problem of formal logic, Proc. London Math. Soc.36 (1930), 264–286.

B. L. van der Waerden,Beweis einer Baudetschen Vermutung, Nieuw Arch. Wisk.15 (1928), 212–216.