A Ramsey theorem for countable homogeneous directed graphs
type: Item
instance of: scholarly article
title: A Ramsey theorem for countable homogeneous directed graphs
zbMATH Open document ID: 1001.05082
DOI: 10.1016/S0012-365X(01)00448-4
published in: Discrete Mathematics
publication date: 2002-08-29T00:00:00Z
review text: Continuing earlier work on the indivisibility of homgeneous graphs, the paper completely describes the vertex partitions of the countable homogeneous directed graph \(H_{\mathcal T}\) which does not embed any of the tournaments in a finite set of finite tournaments \({\mathcal T}\).
reviewed by: Kathrin Klamroth
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 1792441
zbMATH Keywords: homogeneous graph
zbMATH Keywords: tournament
zbMATH Keywords: vertex partition
author: Norbert Sauer
MaRDI profile type: Publication
full work available at URL: s0012-365x(01)00448-4
OpenAlex ID: W2031734179
Recommended article: Q3615795
Recommended article: Ramsey precompact expansions of homogeneous directed graphs
Recommended article: The Ramsey theory of the universal homogeneous triangle-free graph
Recommended article: A Ramsey-Type Theorem for Orderings of a Graph
Recommended article: Ramsey theory for countable binary homogeneous structures
Recommended article: A Ramsey Theorem for Biased Graphs
Recommended article: Countable connected-homogeneous graphs
Recommended article: Menger's theorem for countable graphs
Recommended article: Q4525053
Recommended article: A dual Ramsey theorem for finite ordered oriented graphs
description: scientific article; zbMATH DE number 1792441