There are four countable ultrahomogeneous graphs without triangles
type: Item
instance of: scholarly article
title: There are four countable ultrahomogeneous graphs without triangles
zbMATH Open document ID: 0429.05044
DOI: 10.1016/0095-8956(79)90078-9
published in: Journal of Combinatorial Theory. Series B
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 03E05
Mathematics Subject Classification ID: 03C10
zbMATH DE Number: 3668659
zbMATH Keywords: ultrahomogeneous
zbMATH Keywords: isomorphism
zbMATH Keywords: automorphism
zbMATH Keywords: edgeless graph
zbMATH Keywords: matching
zbMATH Keywords: complete bipartite graph
zbMATH Keywords: universal trianglefree countable graph
zbMATH Keywords: elimination of quantifiers
author: R. E. Woodrow
MaRDI profile type: Publication
full work available at URL: 0095-8956(79)90078-9
OpenAlex ID: W1997180952
cites work: Homogeneous graphs
cites work: Homogeneous Universal Models.
cites work: On complete theories with a finite number of denumerable models
cites work: Q5537599
description: scientific article; zbMATH DE number 3668659