Geodesic
Partition Relations for Ordinal Numbers
Canadian journal of mathematics, Tome 21 (1969) no. 1, pp. 317-334

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

Capital letters denote sets and the cardinal of A is |A|. Greek letters always denote ordinal numbers and, unless stated otherwise, small latin letters denote non-negative integers. The symbol [A]r is used to denote the set {X: X ⊂ A; |X| = r} of all subsets of A with relements. If A is a simply ordered set with the order relation <, then the order type of A with this ordering is written as tp <A or simply as tp A when there is no ambiguity about the intended order relation. A graph G = (A, E) is an ordered pair with A as the set of vertices and E ⊂ [A] 2 as the set of edges. In particular, if A is simply ordered, we call G a graph of type tp A. A complete subgraph of G = (A, E)is a set B ⊂ A such that [B] 2 ⊂ E; a set C⊂ A is independent if [C] 2 ∩ E = ∅. 
Partition Relations for Ordinal Numbers. Canadian journal of mathematics, Tome 21 (1969) no. 1, pp. 317-334. doi: 10.4153/CJM-1969-034-2
@misc{10_4153_CJM_1969_034_2,
     title = {Partition {Relations} for {Ordinal} {Numbers}},
     journal = {Canadian journal of mathematics},
     pages = {317--334},
     year = {1969},
     volume = {21},
     number = {1},
     doi = {10.4153/CJM-1969-034-2},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-034-2/}
}
TY  - JOUR
TI  - Partition Relations for Ordinal Numbers
JO  - Canadian journal of mathematics
PY  - 1969
SP  - 317
EP  - 334
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-034-2/
DO  - 10.4153/CJM-1969-034-2
ID  - 10_4153_CJM_1969_034_2
ER  - 
%0 Journal Article
%T Partition Relations for Ordinal Numbers
%J Canadian journal of mathematics
%D 1969
%P 317-334
%V 21
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1969-034-2/
%R 10.4153/CJM-1969-034-2
%F 10_4153_CJM_1969_034_2

[1] 1. Dushnik, B. and Miller, E. W., Partially ordered sets, Amer. J. Math. 63 (1941), 600–610. Google Scholar

[2] 2. Erdôs, P. and Milner, E. C. (in preparation). Google Scholar

[3] 3. Erdôs, P. and Rado, R., A problem on ordered sets, J. London Math. Soc. 28 (1953), 426–438. Google Scholar

[4] 4. Erdôs, P. and Rado, R., A partition calculus in set theory, Bull. Amer. Math. Soc. 62 (1956), 427–489. Google Scholar

[5] 5. Erdôs, P. and Rado, R., Combinatorial theorems on classifications of subsets of a given set, Proc. London Math. Soc. (3) 2 (1952), 417–439. Google Scholar

[6] 6. Erdôs, P. and Szekeres, G., A combinatorial problem in geometry, Compositio Math. 2 (1935), 463–470. Google Scholar

[7] 7. Erdôs, P., Hajnal, A., and Rado, R., Partition relations for cardinal numbers, Acta Math. Acad. Sci. Hungar. 16 (1965), 93–196. Google Scholar

[8] 8. Graver, J. E. and Yackel, J., Some graph theoretic results associated with Ramsey's theorem, Notices Amer. Math. Soc. 14 (1967), 122. Google Scholar

[9] 9. Greenwood, R. E. and Gleason, A. M., Combinatorial relations and chromatic graphs, Can. J. Math. 7 (1955), 1–7. Google Scholar

[10] 10. Kruse, A. H., A note on the partition calculus of P. Erdôs and R. Rado, J. London Math. Soc. 40 (1965), 137–148. Google Scholar

[11] 11. Milner, E. C. and Rado, R., The pigeon hole principle for ordinal numbers, Proc. London Math. Soc. 15 (1965), 750–768. Google Scholar

[12] 12. Ramsey, F. P., On a problem of formal logic, Proc. London Math. Soc. 29 (1930), 264–286. Google Scholar

[13] 13. Sikorski, R., Boolean algebras, p. 17 (Springer-Verlag, Berlin, 1960). Google Scholar

[14] 14. Specker, E., Teilmengen von Mengen mit Relationen, Comment. Math. Helv. SI (1957), 302–314. Google Scholar

Cité par Sources :