论文信息 - Hereditarily finite sets and identity trees - 字舞流文

Hereditarily finite sets and identity trees

Abstract Some asymptotic results about the sizes of certain sets of hereditarily finite sets, identity trees, and finite games are proven.

John W. Moon | Jan Mycielski | Amram Meir

[1] G. Hardy,et al. An Introduction to the Theory of Numbers , 1938 .

[2] A. Meir,et al. Path node-covering constants for certain families of trees , 1978 .

[3] John W. Moon,et al. Packing and covering constants for certain families of trees. I , 1977, J. Graph Theory.

[4] Frank Harary,et al. The number of homeomorphically irreducible trees, and other species , 1959 .

[5] G. Pólya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .

[6] Edgar M. Palmer,et al. On the number of trees in a random forest , 1979, J. Comb. Theory B.

[7] F. Harary,et al. The theory of graphs and its applications , 1963 .

[8] Allen J. Schwenk,et al. An asymptotic evaluation of the cycle index of a symmetric group , 1977, Discret. Math..

[9] F. R. Drake,et al. Set theory : an introduction to large cardinals , 1974 .

[10] J. V. Tucker,et al. Sets: Naïve, Axiomatic and Applied , 1979 .

[11] R. W. Robinson,et al. Twenty-step algorithm for determining the asymptotic number of trees of various speces , 1975, Journal of the Australian Mathematical Society.

[12] Robert W. Robinson,et al. The distribution of degrees in a large random tree , 1975, Discret. Math..