Enumeration of dihypergraphs with specified degrees and edge types
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918441588359168 |
|---|---|
| author | Greenhill, Catherine Makai, Tamás |
| author_facet | Greenhill, Catherine Makai, Tamás |
| contents | A directed hypergraph (dihypergraph) consists of a set of vertices and a set of hyperarcs, where each hyperarc is partitioned into a head and a tail. Directed hypergraphs are useful in many applications, including the study of chemical reactions or relational databases. We provide asymptotic formulae for the number of directed hypergraphs with given in-degree sequence, out-degree sequence, and with the head and tail sizes of all hyperarcs specified. Our formulae hold when none of the following parameters are too large: the maximum out-degree, the maximum in-degree, the maximum head size and the maximum tail size. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_12874 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Enumeration of dihypergraphs with specified degrees and edge types Greenhill, Catherine Makai, Tamás Combinatorics A directed hypergraph (dihypergraph) consists of a set of vertices and a set of hyperarcs, where each hyperarc is partitioned into a head and a tail. Directed hypergraphs are useful in many applications, including the study of chemical reactions or relational databases. We provide asymptotic formulae for the number of directed hypergraphs with given in-degree sequence, out-degree sequence, and with the head and tail sizes of all hyperarcs specified. Our formulae hold when none of the following parameters are too large: the maximum out-degree, the maximum in-degree, the maximum head size and the maximum tail size. |
| title | Enumeration of dihypergraphs with specified degrees and edge types |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.12874 |