A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the set of simple hypergraph degree sequences
2015
Applied Mathematical Sciences
For a given , 0 < ≤ 2 , let ( ) denote the set of all hypergraphic sequences for hypergraphs with vertices and hyperedges. A hypergraphic sequence in ( ) is upper hypergraphic if all its components are at least /2. Let ̂( ) denote the set of all upper hypergraphic sequences. A structural characterization of the lowest and highest rank maximal elements of ̂( ) was provided in an earlier study. In the current paper we present an analogous characterization for all upper non-hypergraphic sequences.
doi:10.12988/ams.2015.411972
fatcat:e4zjrz5nl5dcrkhqulax4yjwsm