There are four countable ultrahomogeneous graphs without triangles (Q1137597): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:44, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | There are four countable ultrahomogeneous graphs without triangles |
scientific article |
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
