There are four countable ultrahomogeneous graphs without triangles (Q1137597)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: There are four countable ultrahomogeneous graphs without triangles |
scientific article; zbMATH DE number 3668659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | There are four countable ultrahomogeneous graphs without triangles |
scientific article; zbMATH DE number 3668659 |
Statements
There are four countable ultrahomogeneous graphs without triangles (English)
0 references
1979
0 references
ultrahomogeneous
0 references
isomorphism
0 references
automorphism
0 references
edgeless graph
0 references
matching
0 references
complete bipartite graph
0 references
universal trianglefree countable graph
0 references
elimination of quantifiers
0 references
