✦ LIBER ✦

On graphic and 3-hypergraphic sequences

✍ Scribed by S.A. Choudum

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 285 KB
Volume: 87
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90076-e

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we give a necessary condition for a sequence n of integers to be 3-hypergraphic. This necessary condition is on the lines of Erdiis and Gallai conditions for graphic sequences and depends on a function M, defined on n.

📜 SIMILAR VOLUMES

On forcibly connected graphic sequences

✍ S.A. Choudum 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 668 KB

## Choudum, S.A., On forcibly connected graphic sequences, Discrete Mathematics 96 (1991) 175-W. A few sufficient conditions for a graphic sequence to be forcibly connected are obtained.

On forcibly hereditary p-graphical seque

On forcibly hereditary p-graphical sequences

✍ A.A Chernyak; Zh.A Chernyak; R.I Tyshkevich 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 986 KB

Characterizations of forcibly Chordal, forcibly strongly chordal, forcibly interval and forcibly trivially perfect graphical sequences are given. On forcibly hereditary P-graphical sequences 113 Characterizations of forcibly P:graphical se/tuences for hereditary properties P which are major types o

Seven criteria for integer sequences bei

Seven criteria for integer sequences being graphic

✍ Gerard Sierksma; Han Hoogeveen 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB

Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a simple graph with the given integer sequence as d e gree sequence. One of the criteria leads to a new and constructive proof of the well-known criterion of Erdos-Gallai. ## 1. Introduction Let (dl, .

Interchange Theorems for Hypergraphs and

Interchange Theorems for Hypergraphs and Factorization of Their Degree Sequences

✍ A.A. Chernyak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 124 KB

The aim of this paper is to unify interchange theorems and extend them to hypergraphs. To this end sufficient conditions for equality of the l 1 -distance between equivalence classes and the l 1 -distance between corresponding order-type functions are provided. The generality of this result is demon

An unresolved conjecture on nonmaximal p

An unresolved conjecture on nonmaximal planar graphical sequences

✍ Stefano Fanelli 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 229 KB

In this work it is shown that the E&x nonmaxir:lal sequences, 5S555555555553 755555555555555555 (more briefly 5133' 7'5") are not pl-nar graphical, partly proving an unresolved conjecture by Schmeichel and Hakimi.

Note on Kocay's 3-Hypergraphs and Stockm

Note on Kocay's 3-Hypergraphs and Stockmeyer's Tournaments

✍ Stéphanie Conilh 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

In this note, we study the nonreconstructibility property through examples given by Stockmeyer (for tournaments) and Kocay (for 3-hypergraphs). Relating these examples we show how to obtain non (&1)-reconstructible ternary relations from particular non (&1)-reconstructible binary ones.