scientific article; zbMATH DE number 3873374
[For the entire collection see Zbl 0534.00005.] The problem of the realizability of a given non-decreasing sequence of non-negative numbers as the degree sequence of hypergraphs with prescribed properties is studied. This is first done in the case where the cardinalities of the edges of the hypergraphs are given. The solution is of a recursive nature. Explicit necessary and sufficient conditions for the realizability in the class of connected hypergraphs (under the assumption of realizability by some hypergraph) and in the class of hypertrees are proved. A chapter studies concepts like d-path, d- connectivity, d-hypertree where subsets of d-vertices contained entirely in an edge play the role of vertices in the corresponding ordinary concepts.
- Some NP-complete problems for hypergraph degree sequences
- The polytope of degree sequences of hypergraphs
- The average number of spanning hypertrees in sparse uniform hypergraphs
- scientific article; zbMATH DE number 3989391 (Why is no real title available?)
- scientific article; zbMATH DE number 4045790 (Why is no real title available?)
- Graphs and degree sequences. I
- Realizing degree sequences with k-edge-connected uniform hypergraphs
- scientific article; zbMATH DE number 903055 (Why is no real title available?)
- Spanning trees in random regular uniform hypergraphs
- Graph-Theoretic Concepts in Computer Science
- Degree sequences and graphs with disjoint spanning trees
- Degree sequence of oriented k-hypergraphs
- Degree sequences of k-multi-hypertournaments
- Degree sequence and supereulerian graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340895)