Cargando…
Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays
The characterization of k-uniform hypergraphs by their degree sequences, say k-sequences, has been a longstanding open problem for [Formula: see text]. Very recently its decision version was proved to be NP-complete in [3]. In this paper, we consider Saind arrays [Formula: see text] of length [Formu...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7309485/ http://dx.doi.org/10.1007/978-3-030-51466-2_20 |