A recurrence for counting graphical partitions

zbMath0818.05003MaRDI QIDQ1890828

Carla D. Savage

Publication date: 22 May 1995

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_2/volume2.html#R11

zbMATH Keywords

partitionsalgorithmrecurrencecountingdegree sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Graph theory (05C99)

Related Items (7)

Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions ⋮ Efficient generation of graphical partitions ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ Efficient counting of degree sequences ⋮ Mahonian pairs ⋮ Confirming two conjectures about the integer partitions ⋮ A bijection for partitions with all ranks at least \(t\)

This page was built for publication: A recurrence for counting graphical partitions