arXiv (All)
open access
Counting connected multitype graphs with prescribed edge counts
We determine the exponential asymptotics of the number of connected labelled graphs with finitely many vertex types, prescribed numbers of vertices of each type, and prescribed edge counts between each pair of types. Under an irreducibility and strict surplus condition, we express the count for line
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
- Ways of Counting#669648
- Learning Minimally Rigid Graphs with High Realization Counts#178875
- Deterministic NC Quadratic Root Counting in Characteristic Two#1070152
- Look Here or Look Across: Unified Cardinality Constraints for N-ary Relationships#1186917
- Look Here or Look Across: Unified Cardinality Constraints for N-ary Relationships#1181722
Record · ID 1411797
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