Graphical Basis Partitions
✍ Scribed by Paul Erdo˝s; Tom Fowler
- Book ID
- 106048005
- Publisher
- Springer Japan
- Year
- 1998
- Tongue
- English
- Weight
- 160 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We study basis partitions, introduced by Hansraj Gupta in 1978. For this family of partitions, we give a recurrence, a generating function, identities relating basis partitions to more familiar families of partitions, and a new characterization of basis partitions.
Given a positive even integer n, we show how to generate the set G(n) of graphical partitions of n, that is, those partitions of n which correspond to the degree sequences of simple, undirected graphs. The algorithm is based on a recurrence for G(n), and the total time used by the algorithm, indepen
ChvBtal gave a necessary condition for a partition to have a planar realization. It is of interest to find: (i) partitions which satisfy the condition of the theorem but have no planar realization. and also (ii) partitions which satisfy the condition and have only p:!anar realizations. We give a lis
We give a simple proof that the number of graphical partitions of an even positive integer \(n\) is at least \(p(n)-p(n-1) . \quad 1995\) Academic Press. Inc.