A Ramsey theorem for countable homogeneous directed graphs Original Research Article
Author/Authors :
N.W. Sauer، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Pages :
17
From page :
45
To page :
61
Abstract :
Let T be a finite set of finite tournaments and HT the countable homogeneous directed graph which does not embed any of the tournaments in T. We will completely describe the vertex partition property HT.
