Geodesic
On the Divisibility of Homogeneous Directed Graphs
Canadian journal of mathematics, Tome 45 (1993) no. 2, pp. 284-294

Voir la notice de l'article provenant de la source Cambridge University Press

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 .
DOI : 10.4153/CJM-1993-014-0
Mots-clés : 06A10, 05C20, 20B27, homogeneous structures, indivisibility, directed graphs 
El-Zahar, M.; Sauer, N. W. On the Divisibility of Homogeneous Directed Graphs. Canadian journal of mathematics, Tome 45 (1993) no. 2, pp. 284-294. doi: 10.4153/CJM-1993-014-0
@article{10_4153_CJM_1993_014_0,
     author = {El-Zahar, M. and Sauer, N. W.},
     title = {On the {Divisibility} of {Homogeneous} {Directed} {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {284--294},
     year = {1993},
     volume = {45},
     number = {2},
     doi = {10.4153/CJM-1993-014-0},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1993-014-0/}
}
TY  - JOUR
AU  - El-Zahar, M.
AU  - Sauer, N. W.
TI  - On the Divisibility of Homogeneous Directed Graphs
JO  - Canadian journal of mathematics
PY  - 1993
SP  - 284
EP  - 294
VL  - 45
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1993-014-0/
DO  - 10.4153/CJM-1993-014-0
ID  - 10_4153_CJM_1993_014_0
ER  - 
%0 Journal Article
%A El-Zahar, M.
%A Sauer, N. W.
%T On the Divisibility of Homogeneous Directed Graphs
%J Canadian journal of mathematics
%D 1993
%P 284-294
%V 45
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1993-014-0/
%R 10.4153/CJM-1993-014-0
%F 10_4153_CJM_1993_014_0

[1] 1. Cherlin, G., Homogeneous directed graphs, the imprimitive case, Logic colloquium 85, Elsevier, North– Holland, 1987. Google Scholar

[2] 2. El–Zahar, M. and Sauer, N.W., The indivisibility of the homogeneous Kn-free graphs, Journal of Combinatorial Theory B (2) 47, 1989. Google Scholar

[3] 3. Folkman, J., Graphs with monochromatic complete subgraphs in every edgecoloring, SIAM J. Appl. Math. 18(1970), 115–124. Google Scholar

[4] 4. Fraissé, R., Theory of Relations, Studies in Logic and the Foundations of Mathematics, Elsevier Science Publishing Co., Inc., U.S.A. 118(1986). Google Scholar

[5] 5. Henson, C.W., Countable homogeneous relational structures and N-categorical theories, J. Symbolic Logic 37(1972), 494–500. Google Scholar

[6] 6. Komjâth, P. and Rôdl, V., Coloring ofUnviersal Graphs, Graphs and Combinatorics 2(1986), 55–60. Google Scholar

[7] 7. Lachlan, A.H., Countable Homogeneous Tournaments, Trans. Amer. Math. Soc. 284(1984), 431–461. Google Scholar

[8] 8. Lachlan, A.H. and Woodrow, R.E., Countable Ultrahomogeneous Undirected Graphs, Transactions of the American Mathematical Society (1) 262, 1980. Google Scholar

[9] 9. Petetyiatkin, M.G., On complete theories with a finite number of denumerable models, Algebra; Logika 12(1973), 550–576. Google Scholar

[10] 10. Pouzet, M., Relations impartibles, Dissertationes Matimaticae CXCIII, Warszawa, 1981. Google Scholar

[11] 11. Schmerl, J.H., Countable homogeneous partially ordered sets, Algebra Universalis, 9(1979), 317–321. Google Scholar

Cité par Sources :