✦ LIBER ✦

A family of nonreconstructible hypergraphs

✍ Scribed by W.L Kocay

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 894 KB
Volume: 42
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90062-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Great intersecting families of edges in

Great intersecting families of edges in hereditary hypergraphs

✍ D Miklós 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 250 KB

the following conjecture: If Y~ is a hereditary hypergraph on S and .gCcy~ is a family of maximum cardinality of pairwise intersecting members of ~, then there exists an xeS such that d~(x)=l{HeYe:xeH}l=l.al. Berge and Schrnheim proved that 1~1~½ I~el for every ~ and ~. Now we prove that if there ex

A characterization of cube-hypergraphs

✍ Gustav Burosch; Pier Vittorio Ceccherini 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 600 KB

We define the t-uniform cube-hypergraph of dimension n, Q(n, t), as the hypergraph which is the natural analogue of the n-dimensional hypercube Qn' and give a characterization of those t-uniform hypergraphs which are isomorphic to Q(n, t). This extends a previous result of S. Foldes in the graph cas

On a class of balanced hypergraphs

✍ András Frank 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 986 KB

Let P be nn arborcscencc, and let F, = {U,, , I/, ). F, = { \y,, . . , V, } bc two systems consisting of directed s&paths of P. MIntmax theorems and algorithms UC proved concerning the so called bi-pcrth system (P; F,,. F, ). One can define a hypqraph to every hi-path system. The class of t hcsc "Ri

A characterization of totally balanced h

A characterization of totally balanced hypergraphs

✍ Jenö Lehel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 418 KB

A hypergraph is totally balanced if every non-trivial cycle has an edge containing at least three vertices of the cycle. Totally balanced hypergraphs are characterized here as special tree-hypergraphs. This approach provides a conceptually simpler proof of Anstee's related result and yields the stru

Note on isomorphic hypergraphs and some

Note on isomorphic hypergraphs and some extensions of Whitney's theorem to families of sets

✍ C Berge; R Rado 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 667 KB

On the cyclomatic number of a hypergraph

✍ B.D. Acharya 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 572 KB

## This note generalizes the notion of cyclomatic number (or cycle rank) from Graph Theory to Hypergraph Theory and links it up with the concept of planarity in hypergraphs which was recently introducea by R.P. Jones. Sharp bounds are obtained for the cyclomatic number of the planar hypergraphs an