𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a class of balanced hypergraphs

✍ Scribed by András Frank

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
986 KB
Volume
20
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 -p&a " hypergraphs is closed under forminp of dual, sub and partial hypergaph. Every hi-path hypergraph is balanced but not ncces%arily unimtdulur.

📜 SIMILAR VOLUMES

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

A Class of Hypergraph Arrangements with
A Class of Hypergraph Arrangements with Shellable Intersection Lattice
✍ Dmitry N. Kozlov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 126 KB

For every hypergraph on n vertices there is an associated subspace arrangement in R n called a hypergraph arrangement. We prove shellability for the intersection lattices of a large class of hypergraph arrangements. This class incorporates all the hypergraph arrangements which were previously shown

On the cyclomatic number of a hypergraph
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