On graphic and 3-hypergraphic sequences (Q809101): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conditions for sequences to be r-graphic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some NP-complete problems for hypergraph degree sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Degree Sequences in Complexes and Hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Personal reminiscences and remarks on the mathematical work of Tibor Gallai / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3851094 / rank | |||
Normal rank |
Revision as of 18:21, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On graphic and 3-hypergraphic sequences |
scientific article |
Statements
On graphic and 3-hypergraphic sequences (English)
0 references
1991
0 references
This paper deals with n-hypergraphic sequences and n-hypergraphs. The author proves a necessary condition for a sequence to be 3-hypergraphic. He concludes his note by deriving a formula for \(M_ r(\pi)=\max \{(E(G)|:\) \(G\in G_ r(\pi)\}\), where \[ G_ r(\pi)=\{G:\;G\text{ is an \(r\)-graph on \(p\geq 1\) vertices}\}, \] \(r\geq 1\) and \(\pi\) denotes a sequence of p integers, such that the author is able to show that his necessary condition can be checked in polynomial time.
0 references
n-hypergraphic graphs
0 references