On the degree sequences of uniform hypergraphs

DOI10.1007/978-3-642-37067-0_26MaRDI QIDQ4924480zbMATH OpenOpenAlexFDO

Authors S. Rinaldi, Andrea Frosini, Christophe Picouleau

Publication date 31 May 2013

Published in Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37067-0_26

zbMATH Keywords

discrete tomographyhypergraph degree sequenceLyndon wordnecklacereconstruction problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorics on words (68R15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• New sufficient conditions on the degree sequences of uniform hypergraphs
• A tomographical interpretation of a sufficient condition on h-graphical sequences
• On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
• An efficiently recognisable subset of hypergraphic sequences
• On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition

Cited in

(20)

• Some NP-complete problems for hypergraph degree sequences
• The polytope of degree sequences of hypergraphs
• Properties of unique degree sequences of 3-uniform hypergraphs
• On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
• Further steps on the reconstruction of convex polyominoes from orthogonal projections
• A study on the existence of null labelling for 3-hypergraphs
• Generating functions of some families of directed uniform hypergraphs
• Hypergraph recovery algorithms from a given vector of vertex degrees
• Uniform length dominating sequence graphs
• On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two
• Structure and complexity of 2-intersection graphs of 3-hypergraphs
• On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
• A tomographical interpretation of a sufficient condition on h-graphical sequences
• On the degree, size, and chromatic index of a uniform hypergraph
• Characterization and reconstruction of hypergraphic pattern sequences
• An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence
• Reconstruction of hypermatrices from subhypermatrices
• Dense, irregular, yet always-graphic 3-uniform hypergraph degree sequences
• Realizability of hypergraphs and high-dimensional contingency tables with random degrees and marginals
• New sufficient conditions on the degree sequences of uniform hypergraphs

This page was built for publication: On the degree sequences of uniform hypergraphs

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