A note on graphical partitions

DOI10.1006/JCTB.1995.1038MaRDI QIDQ1898726zbMATH OpenOpenAlexFDO

Authors Firasath Ali, Cecil Rousseau

Publication date 8 January 1996

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1995.1038

zbMATH Keywords

graphical partitionsnegative ranks

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Review text

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)\).

Cited in

(8)

• A bijection for partitions with all ranks at least \(t\)
• A note on clutter partitions
• Efficient generation of graphical partitions
• Efficient counting of degree sequences
• scientific article; zbMATH DE number 3865287 (Why is no real title available?)
• scientific article; zbMATH DE number 3993642 (Why is no real title available?)
• Mahonian pairs
• Counting graphic sequences via integrated random walks

This page was built for publication: A note on graphical partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898726)