Countable Ultrahomogeneous Undirected Graphs

Lachlan, A. H., & Woodrow, R. E. (1980). Countable Ultrahomogeneous Undirected Graphs. Transactions of the American Mathematical Society, 51-94.

Type

Journal article

Intellectual base

Primary research

Year

1980

DOI

10.2307/1999974

Link

https://doi.org/10.2307/1999974

Cited by

1 citation across 1 artifact.

Domain-specific

• Homogeneous Graph
  • Gardiner classified the finite homogeneous graphs. Lachlan and Woodrow classified the countably infinite homogeneous undirected graphs, including the Rado graph, Henson graphs and complements, and disjoint unions of equal complete graphs and their complements.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:011a940828a4 · see in the full table