An efficiently recognisable subset of hypergraphic sequences

DOI10.1007/978-3-319-94776-1_33MaRDI QIDQ1790996zbMATH OpenOpenAlexFDO

Authors S. M. Meesum

Publication date 4 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94776-1_33

zbMATH Keywords

hypergraphic sequencesdegree sequences of simple hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65)

Recommendations

• Hypergraphic degree sequences are hard
• A tomographical interpretation of a sufficient condition on \(h\)-graphical sequences
• New sufficient conditions on the degree sequences of uniform hypergraphs
• Essential points of the \(n\)-cube subset partitioning characterisation
• On graphic and 3-hypergraphic sequences

Cited in

(5)

• Hypergraphic degree sequences are hard
• On the degree sequences of uniform hypergraphs
• Optimization over degree sequences
• Essential points of the \(n\)-cube subset partitioning characterisation
• A tomographical interpretation of a sufficient condition on \(h\)-graphical sequences

This page was built for publication: An efficiently recognisable subset of hypergraphic sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790996)