New results on degree sequences of uniform hypergraphs
From MaRDI portal
Publication:396927
zbMath1295.05081MaRDI QIDQ396927
Michael Ferrara, Charles Tomlinson, Benjamin Reiniger, Stephen G. Hartke, Sarah Behrens, Hannah Spinoza, Catherine Erbes
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i4p14
Related Items
Nearly-Regular Hypergraphs and Saturation of Berge Stars ⋮ New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ The weighted hypergraph with the maximum spectral radius ⋮ The maximum spectral radii of uniform supertrees with given degree sequences ⋮ On vertex independence number of uniform hypergraphs ⋮ On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two ⋮ Characterization and reconstruction of hypergraphic pattern sequences ⋮ The maximum \(\alpha \)-spectral radius and the majorization theorem of \(k\)-uniform supertrees ⋮ Structure and complexity of 2-intersection graphs of 3-hypergraphs ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Unnamed Item ⋮ On null 3-hypergraphs ⋮ ON GROWTH TRIANGULAR GRAPHS ⋮ Properties of unique degree sequences of 3-uniform hypergraphs ⋮ On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition ⋮ Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays ⋮ Asymptotic Enumeration of Hypergraphs by Degree Sequence ⋮ A study on the existence of null labelling for 3-hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
- On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic
- On graphic and 3-hypergraphic sequences
- Shifted set families, degree sequences, and plethysm
- Some NP-complete problems for hypergraph degree sequences
- A short proof of Kundu's k-factor theorem
- Contributions to the theory of graphic sequences
- Realizability and uniqueness in graphs
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
- A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge
- Packing of graphic n-tuples
- Shifted simplicial complexes are Laplacian integral
- A remark on the existence of finite graphs
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Seven criteria for integer sequences being graphic
- Degree Sequences in Complexes and Hypergraphs
- Toughness and Vertex Degrees
- Some Properties of Graphs with Multiple Edges
- Graph classes characterized both by forbidden subgraphs and degree sequences
- A note on packing of two copies of a hypergraph
