A Ramsey theorem for countable homogeneous directed graphs

DOI10.1016/S0012-365X(01)00448-4zbMath1001.05082OpenAlexW2031734179MaRDI QIDQ1613517

Norbert W. Sauer

Publication date: 29 August 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00448-4

zbMATH Keywords

tournamentvertex partitionhomogeneous graph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Partitions and indivisibility properties of countable dimensional vector spaces ⋮ Structural Ramsey theory of metric spaces and topological dynamics of isometry groups ⋮ Indivisible homogeneous directed graphs and a game for vertex partitions ⋮ The Urysohn sphere is oscillation stable

This page was built for publication: A Ramsey theorem for countable homogeneous directed graphs