On graphic and 3-hypergraphic sequences (Q809101): Difference between revisions

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.