Properties of Unique Degree Sequences of 3-Uniform Hypergraphs
In 2018 Deza et al. proved the NP-completeness of deciding wether there exists a 3-uniform hypergraph compatible with a given degree sequence. A well known result of Erdös and Gallai (1960) shows that the same problem related to graphs can be solved in polynomial time. So, it becomes relevant to det...
Saved in:
| Main Author: | |
|---|---|
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://dspaceusad7.4science.cloud/handle/123456789/1231 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|