arXiv (All)
open access
On Graphical Partitions with Restricted Parts
An integer partition of $n$ is called graphical if its parts form a degree sequence of a simple graph. While unrestricted graphical partitions have been extensively studied, much less is known when the parts are restricted to a prescribed set. In this work, we investigate the probability that a unif
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The two-block odd partition function#1118843
- A Phase transition in the distribution of the length of integer partitions#938759
- Statistical theory of integer partitions#956550
- A Proof of a Conjecture on Fixed Perimeter Partitions#635983
- A Proof of a Conjecture on Fixed Perimeter Partitions#633634
Record · ID 1116134
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive