✦ LIBER ✦

The Enumeration of Graphical Partitions

✍ Scribed by Metropolis, N.; Stein, P.R.

Book ID: 123500274
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 875 KB
Volume: 1
Category: Article
ISSN: 0195-6698
DOI: 10.1016/S0195-6698(80)80048-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of plane partitions

✍ Edward A Bender; Donald E Knuth 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 607 KB

Enumeration of M-partitions

✍ Øystein J. Rødseth 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 157 KB

Enumeration of Partitions with Hooklengt

Enumeration of Partitions with Hooklengths

✍ Sagan, Bruce 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 623 KB

Series Connected with the Enumeration of

Series Connected with the Enumeration of Partitions

✍ Jackson, F. H. 📂 Article 📅 1904 🏛 Oxford University Press 🌐 English ⚖ 555 KB

Efficient generation of graphical partit

Efficient generation of graphical partitions

✍ Tiffany M. Barnes; Carla D. Savage 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 578 KB

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

An enumeration of graphical designs

✍ Yeow Meng Chee; Petteri Kaski 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB

## Abstract Let Ψ(__t__,__k__) denote the set of pairs (__v__,λ) for which there exists a graphical __t__‐(__v__,__k__,λ) design. Most results on graphical designs have gone to show the finiteness of Ψ(__t__,__k__) when __t__ and __k__ satisfy certain conditions. The exact determination of Ψ(__t__,