𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal coverings of uniform hypergraphs and P-recursiveness

✍ Scribed by Virgil Domocoş

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
280 KB
Volume
159
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Two wide classes of hypergraphs are proved to be enumerated by P-recursive sequences. The open problem of enumerating minimal coverings that are multipartite hypergraphs receives a qualitative-type answer.

📜 SIMILAR VOLUMES

Extension of a clique cover result to un
Extension of a clique cover result to uniform hypergraphs
✍ A. Patricia Shelton; Ronald D. Dutton; Robert C. Brigham 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 137 KB

An r-uniform hypergraph is a structure H = (V, E), where V is a set of nodes and E is a collection of subsets of the nodes, called edges, each of which has size r. H is complete with p I> r nodes if it has all possible (~) edges and is empty if it has no edges. The complement of H is the r-uniform h

Chromatic numbers of hypergraphs and cov
Chromatic numbers of hypergraphs and coverings of graphs
✍ Zevi Miller; Heinrich Müller 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

Burr recently proved [3] that for positive integers m , , m 2 , . . , , m, and any graph G we have x(G) 5 &, if and only if G can be expressed as the edge disjoint union of subgraphs F, satisfying x(F,) 5 m,. This theorem is generalized to hypergraphs. By suitable interpretations the generalization

On line graphs of linear 3-uniform hyper
On line graphs of linear 3-uniform hypergraphs
✍ Metelsky, Yury; Tyshkevich, Regina 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

It is known that the class of line graphs of linear 3-uniform hypergraphs cannot be characterized by a finite list of forbidden induced subgraphs (R. N.