Papers
Topics
Authors
Recent
Search
2000 character limit reached

Maximal Chains of Isomorphic Subgraphs of Countable Ultrahomogeneous Graphs

Published 30 May 2013 in math.LO and math.CO | (1305.7080v1)

Abstract: For a countable ultrahomogeneous graph G let P(G) denote the collection of domains of subgraphs of G isomorphic to G. The order types of maximal chains in the set P(G) U {\o} ordered by the inclusion are characterized as: (I) the order types of compact sets of reals having the minimum non-isolated, if G is the Rado graph or the Henson graph H_n, for some n>2; (II) the order types of compact nowhere dense sets of reals having the minimum non-isolated, if G is the union of \mu disjoint complete graphs of size \nu, where \mu \nu =\omega .

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.