On graphical partitions

DOI10.1007/BF01202789MaRDI QIDQ2367442zbMATH OpenOpenAlexFDO

Authors L. Bruce Richmond, P. 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) Graph theory (05C99) Special sequences and polynomials (11B83)

Review text

For even \(n\), let \(p(n)\) denote the number of partitions of \(n\) and \(G(n)\) denote the number of graphical partitions of \(n\). A partition \(\pi=(\lambda_1,\lambda_2,\dots,\lambda_m)\) is graphical if there exists a graph with degree sequence \(\pi\). The authors discuss progress and possible lines in enquiry on the questions of whether or not \(\lim_{n\to\infty}G(n)/p(n)\) approaches 0, and prove two inequalities: \[ \limsup_{n\to\infty}{G(n)\over P(n)}\leq .4258,\;\liminf_{n\to\infty}n^{1/2}{G(n)\over P(n)}\geq{\pi\over\sqrt 6}. \]

Recommendations

• Publication:4863508
• Asymptotic bounds on graphical partitions and partition comparability
• Graphical basis partitions

Cites work

• A NOTE ON RANKS AND CONJUGACY OF PARTITIONS
• Extension of the partition sieve
• Graphs on Unlabelled Nodes with a Large Number of Edges
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• 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
• SOME ASYMPTOTIC FORMULAE IN THE THEORY OF PARTITIONS
• The distribution of the number of summands in the partitions of a positive integer
• The Evolution of Unlabelled Graphs

Cited in

(25)

• Enumeration of the degree sequences of non-separable graphs and connected graphs
• Graphical basis partitions
• A bijection for partitions with all ranks at least \(t\)
• Bilinear and trilinear partitions of a graph
• Efficient generation of graphical partitions
• Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions
• Efficient counting of degree sequences
• Confirming two conjectures about the integer partitions
• Graph partitions. II
• Sufficient conditions for graphicality of bidegree sequences
• Partitions of Graphs
• scientific article; zbMATH DE number 5989953 (Why is no real title available?)
• scientific article; zbMATH DE number 3889586 (Why is no real title available?)
• scientific article; zbMATH DE number 1262793 (Why is no real title available?)
• scientific article; zbMATH DE number 3993642 (Why is no real title available?)
• scientific article; zbMATH DE number 841655 (Why is no real title available?)
• Asymptotic bounds on graphical partitions and partition comparability
• Bounds on certain classes of Kronecker and \(q\)-binomial coefficients
• On maximal graphical partitions
• scientific article; zbMATH DE number 2188458 (Why is no real title available?)
• Graph-Theoretic Concepts in Computer Science
• Mahonian pairs
• Convex polytopes and enumeration
• Counting graphic sequences via integrated random walks
• Realizability of hypergraphs and high-dimensional contingency tables with random degrees and marginals

This page was built for publication: On graphical partitions

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