Ramsey classes and homogeneous structures

Combinatorics Probability and Computing

Volumn 14, Issue 1-2, 2005, Pages 171-189

  Nešetřil, Jaroslav ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

CURRICULA; GRAPH THEORY; MATHEMATICAL MODELS; NUMBER THEORY; SET THEORY; STUDENTS; THEOREM PROVING;

DISCRETE MATHEMATICS; HOMOGENEOUS STRUCTURES; RAMSEY CLASSES; RAMSEY THEORY;

COMBINATORIAL MATHEMATICS;

EID: 14544269497     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548304006716     Document Type: Article

References (31)

1. Cameron, P. (1998) The random graph. In The Mathematics of Paul Erdos (R. L. Graham and J. Nešetřil, eds), Springer, pp. 331-351.
2. Cherlin, G. L. (1998) The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments. Mem. Amer. Math. Soc. 131 621.
3. Deuber, W. (1973) Partitionen und lineare Gleichungssysteme. Math. Z. 133 109-123.
4. Deuber, W. (1975) Partitionstheoreme für Graphen. Math. Helv. 50 311-320.
5. Fraïssé, R. (1986) Théorie des Relations, North-Holland.
6. Gowers, W. T. The two cultures of mathematics. Electronic preprint.
7. Graham, R. L., Leeb, K. and Rothschild, B. L. (1972) Ramsey's theorem for a class of categories. Adv. Math. 8 417-433.
8. Graham, R. L., Rothschild, B. L. and Spencer, J. (1980/1990) Ramsey Theory, Wiley (1980); 2nd edn (1990).
9. Hodges, W. (1993) Model Theory, Cambridge University Press.
10. Hubička, J. and Nešetřil, J. (2003) On homogeneous graphs and posets. ITI Series 2003-113, Charles University, Prague.
11. Kechris, A. S., Pestov, V. G. and Todorcevic, S. (2003) Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups. To appear in GAFA.
12. Lachlan, A. H. (1984) Countable homogeneous tournaments. Trans. Amer. Math. Soc. 284 431-461.
13. Lachlan, A. H. (1984) On countable stable structures which are homogeneous for finite relational language. Israel J. Math. 69-153.
14. Lachlan, A. H. (1987) Homogeneous structures. In Proc. of the ICM 1986, AMS, Providence, pp. 314-321.
15. Lachlan, A. H. and Woodrow, R. (1980) Countable ultrahomogeneous undirected graph. Trans. Amer. Math. Soc. 262 51-94.
16. Leeb, K. (1973) Vorlesungen über Pascaltheorie, Universität Erlangen.
17. Nešetřil, J. (1984) Some Ramsey-like applications. Theor. Comput. Sci. 34 3-15.
18. Nešetřil, J. (1989) For graphs there are only four types of hereditary Ramsey classes. J. Combin. Theory Ser. B 46 127-132.
19. Nešetřil, J. (1995) Ramsey theory. In Handbook of Combinatorics (R. L. Graham, M. Grötschel and L. Lovász, eds), Elsevier, pp. 1331-1403.
20. Nešetřil, J. (1999) Aspects of structural combinatorics (Graph homomorphisms and their use). Taiwanese J. Math. 3 381-424.
21. Nešetřil, J. Ramsey metric spaces. To appear in Europ. J. Combin.
22. Nešetřil, J. and Rödl, V. (1975) Type theory of partition properties of graphs. In Recent Advances in Graph Theory (M. Fiedler, ed.), Academia, Prague, pp. 405-412.
23. Nešetřil, J. and Rödl, V. (1975) Partitions of subgraphs. In Recent Advances in Graph Theory (M. Fiedler, ed.), Academia, Prague, pp. 413-423.
24. Nešetřil, J. and Rödl, V. (1978) Partitions of finite relational and set systems. J. Combin. Theory Ser. A 22 289-312.
25. Nešetřil, J. and Rödl, V. (1978) A probabilistic graph-theoretical method. Proc. Amer. Math. Soc. 72 417-421.
26. Nešetřil, J. and Rödl, V. (1984) Combinatorial partitions of finite posets and lattices: Ramsey lattices. Alg. Univ. 19 106-119.
27. Nešetřil, J. and Rödl, V. (1990) Mathematics of Ramsey Theory, Springer.
28. Nešetřil, J. and Shelah, S. (2003) On the order of countable graphs. Europ. J. Combin. 24 649-663.
29. Nešetřil, J., Prömel, H.-J., Rödl, V. and Voigt, B. (1985) Canonizing ordering theorems for Hales-Jewett structures. J. Combin. Theory Ser. A 40 394-408.
30. Schmerl, J. (1979) Countable homogeneous partially ordered sets. Alg. Univ. 9 317-321.
31. Thomas, S. (1986) Groups acting on infinite dimensional projective spaces. J. London Math. Soc. 34 265-273.