论文信息 - On graphical partitions

On graphical partitions

An integer partition {λ1,λ2,...,λv} is said to be graphical if there exists a graph with degree sequence 〈λi〉. We give some results corcerning the problem of deciding whether or not almost all partitions of even integer are non-graphical. We also give asymptotic estimates for the number of partitions with given rank.

Paul Erdös | L. Bruce Richmond

[1] P. Erdös,et al. The distribution of the number of summands in the partitions of a positive integer , 1941 .

[2] Paul Erdös,et al. On some asymptotic formulas in the theory of partitions , 1946 .

[3] E. M. Wright. Graphs on Unlabelled Nodes with a Large Number of Edges , 1974 .

[4] P. Turán,et al. On some problems of the statistical theory of partitions with application to characters of the symmetric group. II , 1977 .

[5] E. M. Wright,et al. The Evolution of Unlabelled Graphs , 1976 .

[6] David M. Bressoud,et al. Extension of the partition sieve , 1980 .

[7] A. O. L. Atkin,et al. A NOTE ON RANKS AND CONJUGACY OF PARTITIONS , 1966 .

[8] Frank Harary,et al. Graph Theory , 2016 .