No label defined (Q3829588)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4105024
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4105024

      Statements

      0 references
      0 references
      0 references
      1989
      0 references
      classification
      0 references
      recursively categorical highly recursive graphs
      0 references
      [For the entire collection see Zbl 0667.00005.] From the introduction: ``We attempt to classify the recursively categorical highly recursive graphs. We first show that all rigid highly recursive graphs are recursively categorical. The proof can be extended to show that highly recursive graphs with a more general condition on their automorphisms are recursively categorial. We then give an example of a graph that is not recursively categorical. Finally we state (but do not prove) a theorem that exactly classifies which highly recursive rooted graphs (graphs having a distinguished point) are recursively categorical. Analogous theorems for recursive graphs are nonexistent, and in fact there are rigid recursive graphs that are not recursively categorical.'' [For the notations see the paper itself.]
      0 references

      Identifiers