Edge partitions of the countable triangle free homogeneous graph

Discrete Mathematics

Volumn 185, Issue 1-3, 1998, Pages 137-181

  Sauer, Norbert ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041354064     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00169-6     Document Type: Article

References (12)

1. G.L. Cherlin, The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments, Memoirs Amer. Math. Soc., to appear.
2. D. Devlin, Some partition theorems and ultrafilters on ω, Ph.D. thesis, Dartmouth College, 1979.
3. n, J. Combin. Theory Ser. 47 (2) (October 1989).
4. M. El-Zahar, N.W. Sauer, Can. J. Math. 45 (1993) 284-294.
5. M. El-Zahar, N.W. Sauer, Combinatorica 14 (1994) 1-7.
6. M. El-Zahar, N.W. Sauer, Discrete Math. 93 (1991) 1-10.
7. P. Erdos, A. Hajnal, L. Pósa, Strong embeddings of graphs into colored graphs, in: A. Hajnal, R. Rado, V.T. Sós (Eds.), Colloquia Mathematica Societatis János Bolyai, 10, vol. I, Infinite and finite sets, pp. 585-595.
8. R. Fraïssé, Theory of Relations, Studies in Logic and the Foundations of Mathematics, vol. 118, Elsevier, New York, 1986, p. 313.
9. A. Hajnal, True Embedding Partition Relations, Finite and Infinite Combinatorics in Sets and Logic, Nato ASI Ser. C: Mathematical and Physical Sciences, vol. 411, 1991, pp. 135-151.
10. P. Komjáth, V. Rödl, Coloring of universal graphs, Graphs and Combinatorics 2 (1986).
11. M. Pouzet, N.W. Sauer, Edge partitions of the Rado graph, Combinatorica 16 (1996) 505-520.
12. S. Todorcevic, Some partitions of three-dimensional combinatorial cubes, J. Combin. Theory Ser. A 68 (1994) 410-437.