References
P. Erdős andA. Hajnal, On a classification of denumerable order types and an application to the partition calculus,Fund. Math. 51 (1962), 117–129.
R. Fraîssé, Sur la comparaison des types d'ordres,Comptes Rendus Acad. Sci. Paris 226 (1948) 1330–1331.
F. Hausdorff, Grundzüge einer Theorie der geordneten Mengen,Math. Ann. 65 (1908), 435–505.
G. Higman, Ordering by divisibility in abstract algebras,Proc. London Math. Soc. (3)2 (1952) 326–336.
D. König,Theorie der Endlichen und Unendlichen Graphen, New York, 1950.
R. Laver,Ph. D. Thesis, Berkeley, 1969.
C. St. J. A. Nash-Williams, On well-quasi-ordering infinite trees,Proc. Camb. Phil. Soc. 61 (1965), 697–720.
W. Sierpiński, Sur les types d'ordre des ensembles linéaires,Fund. Math. 37 (1950), 253–264.
Author information
Authors and Affiliations
Additional information
Research supported by NRC grant No. A 5198-0982. This paper was written at the Canadian Mathematical Congress 1969 Summer Research Institute in Vancouver.
Rights and permissions
About this article
Cite this article
Hajnal, A., Milner, E.C. Some theorems for scattered ordered sets. Period Math Hung 1, 81–92 (1971). https://doi.org/10.1007/BF02029165
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02029165