Abstract
AbstractLet 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 .
Publisher
Canadian Mathematical Society
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献