Expansions of Ultrahomogeneous Graphs

Notre Dame Journal of Formal Logic 36 (3):414-424 (1995)
  Copy   BIBTEX

Abstract

Lachlan and Woodrow have completly classified the countable ultrahomogeneous graphs. We expand the language of graphs to include a new unary predicate. In this expanded language, ultrahomogeneous vertex 2-colorings of ultrahomogeneous graphs are classified

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,667

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
Reversibility of extreme relational structures.Miloš S. Kurilić & Nenad Morača - 2020 - Archive for Mathematical Logic 59 (5-6):565-582.
Ultrahomogeneous Structures.Bruce I. Rose & Robert E. Woodrow - 1981 - Mathematical Logic Quarterly 27 (2-6):23-30.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Automorphisms of $\omega$-octahedral graphs.J. C. E. Dekker - 1982 - Notre Dame Journal of Formal Logic 23 (4):427-434.
The Number of Countable Differentially Closed Fields.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):99-113.
The Ramsey theory of Henson graphs.Natasha Dobrinen - 2022 - Journal of Mathematical Logic 23 (1).

Analytics

Added to PP
2010-08-24

Downloads
22 (#979,903)

6 months
10 (#423,770)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On generic structures.D. W. Kueker & M. C. Laskowski - 1992 - Notre Dame Journal of Formal Logic 33 (2):175-183.

Add more references