Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-19T04:19:40.128Z Has data issue: false hasContentIssue false

On the Divisibility of Homogeneous Directed Graphs

Published online by Cambridge University Press:  20 November 2018

M. El-Zahar
Affiliation:
Department of Mathematics, University of Calgary, Calgary, Alberta, T2N 1N4
N. W. Sauer
Affiliation:
Department of Mathematics, University of Calgary, Calgary, Alberta, T2N 1N4
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let be a finite set of finite tournaments. We will give a necessary and sufficient condition for the -free homogeneous directed graph to be divisible. That is, that there is a partition of into two classes such that neither of them contains an isomorphic copy of .

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1993