Canonical vertex partitions

Combinatorics Probability and Computing

Volumn 12, Issue 5-6 SPEC. ISS., 2003, Pages 671-704

  Sauer, N W ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS; THEOREM PROVING;

CANONICAL VERTEX PARTITIONS; RELATIONAL STRUCTURES;

SET THEORY;

EID: 2942512073     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548303005765     Document Type: Article

References (11)

1. Dilworth, R. P. (1950) A decomposition theorem for partially ordered sets. Ann. Math. 51 161-166.
2. n-free graphs. J. Combin. Theory Ser. B 47 162-170.
3. El-Zahar, M. and Sauer, N. W. (1990) Partition theorems for graphs respecting the chromatic number. In Cycles and Rays (G. Hahn, G. Sabidussi and R. Woodrow, eds), Vol. 301 of NATO ASI Ser. C: Mathem. and Phys. Sc., Kluwer Academic Publishers, Dordrecht, pp. 237-242.
4. El-Zahar, M. and Sauer, N. W. (1991) Ramsey-type properties of relational structures. Discrete Math. 115 1-10.
5. El-Zahar, M. and Sauer, N. W. (1993) On the divisibility of homogeneous directed graphs. Can. J. Math. 45 284-294.
6. El-Zahar, M. and Sauer, N. W. A game for vertex partitions. Submitted to Discrete Math.
7. Fraïssé, R. (2000) Theory of Relations, revised edn, Vol. 145 of Studies in Logic and the Foundations of Mathematics, North-Holland.
8. Komjath, P. and Rödl, V. (1986) Coloring of universal graphs. Graphs Combin. 2 55-60.
9. Sauer, N. W. (1998) Edge partitions of the countable triangle free homogeneous graph. Discrete Math. 185 137-181.
10. Sauer, N. W. (2000) Appendix of Theory of Relations (R. Fraïssé), revised edn, Vol. 145 of Studies in Logic and the Foundations of Mathematics, North-Holland.
11. Sauer, N. W. (2002) A Ramsey theorem for countable homogeneous directed graphs. Discrete Math. 253 45-61.