Article contents
On the Divisibility of Homogeneous Directed Graphs
Published online by Cambridge University Press: 20 November 2018
Abstract
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 .
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1993
References
- 7
- Cited by