No label defined (Q3340895)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3873374
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3873374

      Statements

      0 references
      1984
      0 references
      uniform hypergraph
      0 references
      degree sequence
      0 references
      hypertree
      0 references
      [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.
      0 references

      Identifiers