Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence.
Partite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each hyperedge contains exactly one point from each of the 3 disjoint vertex classes. We consider the degree sequence problem of partite, 3-uniform hypergraphs, that is, to decide if such a hypergraph with prescribed degree sequences...
| Հիմնական հեղինակներ: | , , , , |
|---|---|
| Ձևաչափ: | Հոդված |
| Լեզու: | English |
| Հրապարակվել է: |
Public Library of Science (PLoS)
2024-01-01
|
| Շարք: | PLoS ONE |
| Առցանց հասանելիություն: | https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0303155&type=printable |
Search Result 1
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence
Հրապարակվել է 2024-01-01
Ստացեք ամբողջական տեքստը
Հոդված