Degree Sequences in Complexes and Hypergraphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3149588 (Why is no real title available?)
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- 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
Cited in
(17)- Randomized algorithms to generate hypergraphs with given degree sequences
- New results on degree sequences of uniform hypergraphs
- On graphic and 3-hypergraphic sequences
- New sufficient conditions on the degree sequences of uniform hypergraphs
- Integer points in the degree-sequence polytope
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
- On connectivity of triangulations of manifolds
- A study on the existence of null labelling for 3-hypergraphs
- The polytope of degree sequences of hypergraphs
- Realizing degree sequences with k-edge-connected uniform hypergraphs
- On null 3-hypergraphs
- On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
- Properties of unique degree sequences of 3-uniform hypergraphs
- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
- On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two
- Structure and complexity of 2-intersection graphs of 3-hypergraphs
- Convex hulls of Grassmannians and combinatorics of symmetric hypermatrices
This page was built for publication: Degree Sequences in Complexes and Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4085762)
