Article contents
Infinite imprimitive homogeneous 3-edge-colored complete graphs
Published online by Cambridge University Press: 12 March 2014
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0022481200013967/resource/name/firstPage-S0022481200013967a.jpg)
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1999
References
REFERENCES
[1]Cherlin, Gregory, Homogeneous directed graphs I. The imprimitive case., In Paris Logic Group, editor, Logic Colloquium 1985 (New York), North-Holland, 1987, MR 88d:03074, pp. 67–88.Google Scholar
[2]Cherlin, Gregory, Homogeneous tournaments revisited, Geometria Dedicata, vol. 26 (1988), pp. 231–240, MR 89k:05039.CrossRefGoogle Scholar
[3]Cherlin, Gregory, Homogeneous directed graphs and n-tournaments, Memoirs of the American Mathematical Society, vol. #247 (anticipated), 1998, to appear.Google Scholar
[4]Cherlin, Gregory and Lachlan, Alistair H., Finitely homogeneous relational structures, Transactions of the American Mathematical Society, vol. 296 (1986), pp. 815–850, MR 88f:03023.CrossRefGoogle Scholar
[5]Knight, Julia and Lachlan, Alistair H., Shrinking, stretching, and codes for homogeneous structures, Classification theory, Chicago, 1985 (Baldwin, John, editor), Lecture Notes in Mathematics, vol. 1292, Springer, 1987, MR 90k:03033.Google Scholar
[6]Lachlan, Alistair H., Verification of the classification of stable homogeneous 3-graphs, undated preprint ca. 1982, 33 pp.Google Scholar
[7]Lachlan, Alistair H., Finite homogeneous simple digraphs, Logic Colloquium 1981 (New York) (Stern, Jacques, editor), Studies in Logic and the Foundations of Mathematics, vol. 107, North-Holland, 1982, MR 85h:05049, pp. 189–208.Google Scholar
[8]Lachlan, Alistair H., Countable homogeneous tournaments, Transctions of the American Mathematical Society, vol. 284 (1984), pp. 431–461, MR 85i:05118.Google Scholar
[9]Lachlan, Alistair H., On countable stable structures which are homogeneous for a finite relational language, Israel Journal of Mathematics, vol. 49 (1984), pp. 69–153, MR 87h:03047a.Google Scholar
[10]Lachlan, Alistair H., Binary homogeneous structures II, Proceedings of the London Mathematical Society, vol. 52 (1986), pp. 412–426, MR 87m:03043.Google Scholar
[11]Lachlan, Alistair H., Homogeneous structures, Proceedings of the International Congress of Mathematicians 1986 (Providence, RI) (Gleason, Andrew, editor), American Mathematical Society, 1987, MR 89d:03030, pp. 314–321.Google Scholar
[12]Lachlan, Alistair H. and Tripp, Allyson, Finite homogeneous 3-graphs, Mathematical Logic Quarterly, vol. 41 (1995), pp. 287–306. NB: This deals with 3-hypergraphs.CrossRefGoogle Scholar
[13]Lachlan, Alistair H. and Woodrow, Robert, Countable ultrahomogeneous undirected graphs, Transactions of the Amerincan Mathematical Society, vol. 262 (1980), pp. 51–94, MR 82c:05083.Google Scholar
- 1
- Cited by