On graphical partitions

DOI10.1007/BF01202789zbMath0790.05008OpenAlexW2017999900MaRDI QIDQ2367442

L. Bruce Richmond, Paul Erdős

Publication date: 16 August 1993

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202789

zbMATH Keywords

graphical partitions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Special sequences and polynomials (11B83) Graph theory (05C99)

Related Items (10)

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 ⋮ Bounds on certain classes of Kronecker and \(q\)-binomial coefficients ⋮ Convex polytopes and enumeration ⋮ Confirming two conjectures about the integer partitions ⋮ A bijection for partitions with all ranks at least \(t\) ⋮ Enumeration of the degree sequences of non-separable graphs and connected graphs

Cites Work

• Unnamed Item
• Extension of the partition sieve
• The distribution of the number of summands in the partitions of a positive integer
• The Evolution of Unlabelled Graphs
• On some problems of the statistical theory of partitions with application to characters of the symmetric group. I
• On some problems of the statistical theory of partitions with application to characters of the symmetric group. II
• On some problems of the statistical theory of partitions with application to characters of the symmetric group. III
• Graphs on Unlabelled Nodes with a Large Number of Edges
• A NOTE ON RANKS AND CONJUGACY OF PARTITIONS
• SOME ASYMPTOTIC FORMULAE IN THE THEORY OF PARTITIONS

This page was built for publication: On graphical partitions