𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of totally balanced hypergraphs

✍ Scribed by Jenö Lehel

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
418 KB
Volume
57
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 structural description of totally balanced hypergraphs.

📜 SIMILAR VOLUMES

On a class of balanced hypergraphs
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 cube-hypergraphs
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

Strong total chromatic numbers of comple
Strong total chromatic numbers of complete hypergraphs
✍ Peter Cowling 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 227 KB

We determine the strong total chromatic number of the complete h-uniform hypergraph Kh, and the complete h-partite hypergraph K,\* ............ .