Electronic Resource
Springer
Combinatorica
13 (1993), S. 57-63
ISSN:
1439-6912
Keywords:
10 J 20
;
05 C 99
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract 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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01202789
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |