arXiv (All)
open access
Enumeration of regular multipartite hypergraphs
We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.
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
- Scalable Algorithm for Dynamic Quasi-clique Detection#1144814
- Concentration of the hypergraph's weak independence number#924465
- Concentration of the hypergraph's weak independence number#920234
- On the distinct maximal-clique sizes in $k$-uniform hypergraphs#998314
- Bounds for Unions of Several Parts in Balanced Graph Partitions#1105486
Record · ID 1049618
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