Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
From MaRDI portal
Publication:2106608
DOI10.1007/978-3-030-51466-2_20OpenAlexW3037549206MaRDI QIDQ2106608
Giulia Palma, Andrea Frosini, Simone Rinaldi
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_20
Related Items (2)
Characterization and reconstruction of hypergraphic pattern sequences ⋮ Properties of unique degree sequences of 3-uniform hypergraphs
Uses Software
Cites Work
- New results on degree sequences of uniform hypergraphs
- Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
- New sufficient conditions on the degree sequences of uniform hypergraphs
- Some NP-complete problems for hypergraph degree sequences
- Realizability and uniqueness in graphs
- On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
- Degree Sequences in Complexes and Hypergraphs
- Optimization over Degree Sequences
- A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
