New sufficient conditions on the degree sequences of uniform hypergraphs
From MaRDI portal
Publication:831139
DOI10.1016/j.tcs.2021.04.006zbMath1502.05176OpenAlexW3154199813MaRDI QIDQ831139
Andrea Frosini, Christophe Picouleau, Simone Rinaldi
Publication date: 10 May 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.04.006
Related Items (5)
Characterization and reconstruction of hypergraphic pattern sequences ⋮ Structure and complexity of 2-intersection graphs of 3-hypergraphs ⋮ Unnamed Item ⋮ Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays ⋮ A study on the existence of null labelling for 3-hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New results on degree sequences of uniform hypergraphs
- Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
- A reconstruction algorithm for a subclass of instances of the 2-color problem
- Symmetry types of periodic sequences
- Realizability and uniqueness in graphs
- A fast algorithm to generate necklaces with fixed content
- Discrete tomography. Foundations, algorithms, and applications
- The lattice of integer partitions
- On null 3-hypergraphs
- Essential points of the \(n\)-cube subset partitioning characterisation
- A solvable case of image reconstruction in discrete tomography
- Using graphs for some discrete tomography problems
- Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
- Combinatorial Properties of Matrices of Zeros and Ones
- Degree-constrained edge partitioning in graphs arising from discrete tomography
- Solving Some Instances of the 2-Color Problem
- The 1-Color Problem and the Brylawski Model
- Seven criteria for integer sequences being graphic
- Degree Sequences in Complexes and Hypergraphs
- Optimization over Degree Sequences
- On the Degree Sequences of Uniform Hypergraphs
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences
This page was built for publication: New sufficient conditions on the degree sequences of uniform hypergraphs
