On graphical partitions |
| |
| Authors: | P Erdős L B Richmond |
| |
| Institution: | (1) Mathematical Institute of the, Hungarian Academy of Sciences, Budapest, Hungary;(2) University of Waterloo, N2L 3G1 Waterloo, Ontario, Canada |
| |
| 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. |
| |
| Keywords: | 10 J 20 05 C 99 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
