Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays

DOI10.1007/978-3-030-51466-2_20MaRDI QIDQ2106608zbMATH OpenOpenAlexFDO

Authors G. Palma, Andrea Frosini, S. Rinaldi

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-51466-2_20

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Properties of unique degree sequences of 3-uniform hypergraphs
• New sufficient conditions on the degree sequences of uniform hypergraphs
• On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
• On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
• On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two

Cites work

• A tomographical interpretation of a sufficient condition on h-graphical sequences
• Degree Sequences in Complexes and Hypergraphs
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
• New results on degree sequences of uniform hypergraphs
• New sufficient conditions on the degree sequences of uniform hypergraphs
• On 3-hypergraphs with equal degree sequences.
• On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
• Optimization over degree sequences
• Realizability and uniqueness in graphs
• Some NP-complete problems for hypergraph degree sequences
• Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size

Cited in

(4)

• Properties of unique degree sequences of 3-uniform hypergraphs
• Characterization and reconstruction of hypergraphic pattern sequences
• An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence
• Randomized algorithms to generate hypergraphs with given degree sequences

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays

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