Edge partitions of the countable triangle free homogeneous graph
type: Item
instance of: scholarly article
title: Edge partitions of the countable triangle free homogeneous graph
zbMATH Open document ID: 0955.05089
DOI: 10.1016/S0012-365X(97)00169-6
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1524844
zbMATH Keywords: edge partition problems
zbMATH Keywords: coloring
zbMATH Keywords: countable triangle free homogeneous graph
author: Norbert Sauer
MaRDI profile type: Publication
cites work: The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
cites work: On the Divisibility of Homogeneous Directed Graphs
cites work: Q4071274
cites work: Theory of relations. Transl. from the French by P. Clote
cites work: Q4881844
cites work: Coloring of universal graphs
cites work: Edge partitions of the Rado graph
cites work: Some partitions of three-dimensional combinatorial cubes
full work available at URL: s0012-365x(97)00169-6
OpenAlex ID: W1986338026
description: scientific article; zbMATH DE number 1524844