An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence

DOI10.1016/J.TCS.2024.114872MaRDI QIDQ6634379

Could not fetch data.

Publication date: 7 November 2024

Published in: (Search for Journal in Brave)

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Partial orders, general (06A06) Hypergraphs (05C65) Ordered sets (06A99) Graph theory (05C99) Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• New results on degree sequences of uniform hypergraphs
• New sufficient conditions on the degree sequences of uniform hypergraphs
• Properties of unique degree sequences of 3-uniform hypergraphs
• Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Seven criteria for integer sequences being graphic
• Optimization over Degree Sequences
• On the Degree Sequences of Uniform Hypergraphs
• A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences

This page was built for publication: An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence

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