There are four countable ultrahomogeneous graphs without triangles (Q1137597): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Homogeneous graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Homogeneous Universal Models. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On complete theories with a finite number of denumerable models / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5537599 / rank | |||
Normal rank | |||
Latest revision as of 03:32, 13 June 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
