On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
From MaRDI portal
Publication:2061815
DOI10.1007/978-3-030-76657-3_24zbMATH Open1487.05179OpenAlexW3161036109MaRDI QIDQ2061815FDOQ2061815
G. Palma, S. Rinaldi, Andrea Frosini
Publication date: 21 December 2021
Full work available at URL: http://hdl.handle.net/2158/1242516
Recommendations
- New sufficient conditions on the degree sequences of uniform hypergraphs
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
- Properties of unique degree sequences of 3-uniform hypergraphs
- On the degree sequences of uniform hypergraphs
- scientific article; zbMATH DE number 4200248
Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex degrees (05C07) Hypergraphs (05C65)
Cites Work
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some NP-complete problems for hypergraph degree sequences
- Degree Sequences in Complexes and Hypergraphs
- A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences
- A fast algorithm to generate necklaces with fixed content
- Optimization over Degree Sequences
- On the Degree Sequences of Uniform Hypergraphs
Cited In (4)
This page was built for publication: On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061815)
