Object
Title: On the Set of Simple Hypergraph Degree Sequences
Abstract:
For a given m, 0 < m ≤ 2 n, let Dm (n) denote the set of all hypergraphic sequences for hypergraphs with n vertices and m hyperedges. A hypergraphic sequence in Dm (n) is upper hypergraphic if all its components are at least m/2. Let ^Dm (n) denote the set of all upper hypergraphic sequences. A structural characterization of the lowest and highest rank maximal elements of ^Dm (n) was provided in an earlier study. In the current paper we present an analogous characterization for all upper non-hypergraphic sequences. This allows determining the thresholds r ̅ min and r�� such that all upper sequences of ranks lower than r ̅ min are hypergraphic and all sequences of ranks higher than r�� are non-hypergraphic.
Publisher:
Date submitted:
Date of publication:
Identifier:
oai:noad.sci.am:135985
DOI:
ISSN:
Other identifier:
Language:
Journal or Publication Title:
Volume:
Number:
URL:
Additional Information:
Affiliation:
Institute for Informatics and Automation Problems
Country:
Indexing:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Publications
Last modified:
Mar 2, 2021
In our library since:
Jul 28, 2020
Number of object content hits:
17
All available object's versions:
https://noad.sci.am/publication/149598
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Hasmik Sahakyan, On the Set of Simple Hypergraph Degree Sequences | Mar 2, 2021 |
