Summary
We present some results on countable homogeneous 3-hypergraphs. In particular, we show that there is no unexpected homogeneous 3-hypergraph determined by a single constraint.
Similar content being viewed by others
References
Cherlin, G.: Homogeneous directed graphs: The imprimitive case. In: The Paris Logic Group (ed) Logic Colloquium '85, pp. 67–88. Amsterdam: Elsevier (North-Holland) 1987
Fraïssé, R.: Sur l'extension aux relations de quelques propriétés des ordres. Ann. Sci. Ecole Norm. Supp. (3)71, 363–388 (1954)
Gardiner, A.: Homogeneous graphs, J. Combinat. Theory Ser. B20, no. 1, 94–102 (1976)
Ward Henson, C.: A family of countable homogeneous graphs. Pacific J. Math.38, 69–83 (1971)
Lachlan, A.H.: Countable homogeneous tournaments. Trans. Amer. Math. Soc.284, 431–461 (1984)
Lachlan, A.H.: Homogeneous structures. In: Proceedings of the International Congress of Mathematicians. Berkeley, California, USA, pp. 314–322 (1986)
Lachlan, A.H., Tripp, A.: Finite homogeneous 3-graphs. Preprint
Lachlan, A.H., Woodrow, R.E.: Countable ultrahomogeneous graphs. Trans. Amer. Math. Soc.262, 155–180 (1980)
Tripp, A.: Finite homogeneous 3-graphs. M.Sc. thesis, Simon Fraser University (1993)
Woodrow, R.E.: There are four countable ultrahomogeneous graphs without triangles. J. Combin. Theory Ser. B27, no. 2, 168–179 (1979)
Author information
Authors and Affiliations
Additional information
The authors are grateful for support from NSERC (Canada) Grant A3040
Rights and permissions
About this article
Cite this article
Akhtar, R., Lachlan, A.H. On countable homogeneous 3-hypergraphs. Arch Math Logic 34, 331–344 (1995). https://doi.org/10.1007/BF01387512
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01387512