On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
From MaRDI portal
Publication:2061815
DOI10.1007/978-3-030-76657-3_24zbMath1487.05179OpenAlexW3161036109MaRDI QIDQ2061815
Giulia Palma, Simone Rinaldi, Andrea Frosini
Publication date: 21 December 2021
Full work available at URL: http://hdl.handle.net/2158/1242516
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two ⋮ Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
Cites Work
- Some NP-complete problems for hypergraph degree sequences
- A fast algorithm to generate necklaces with fixed content
- Degree Sequences in Complexes and Hypergraphs
- Optimization over Degree Sequences
- On the Degree Sequences of Uniform Hypergraphs
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences
- Unnamed Item
- Unnamed Item
This page was built for publication: On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
