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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Expansions of geometries.John T. Baldwin - 2003 - Journal of Symbolic Logic 68 (3):803-827.
.Jay Zeman - unknown
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
What is o-minimality?Harvey M. Friedman - 2008 - Annals of Pure and Applied Logic 156 (1):59-67.
Two cardinal properties of homogeneous graphs.Gregory Cherlin & Simon Thomas - 2002 - Journal of Symbolic Logic 67 (1):217-220.

Analytics

Added to PP
2010-08-24

Downloads
9 (#1,224,450)

6 months
2 (#1,232,442)

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