𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On partitioning of hypergraphs

✍ Scribed by Sergei L. Bezrukov; Roberto Battiti

Book ID
108113732
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
648 KB
Volume
307
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Partitioning 3-uniform hypergraphs
Partitioning 3-uniform hypergraphs
✍ Jie Ma; Xingxing Yu πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 291 KB
Partition Critical Hypergraphs
Partition Critical Hypergraphs
✍ ZoltΓ‘n FΓΌredi; Attila Sali πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 185 KB
Judicious Partitions of Hypergraphs
Judicious Partitions of Hypergraphs
✍ B. BollobΓ‘s; A.D. Scott πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 348 KB

We prove the asymptotically best possible result that, for every integer k 2, every 3-uniform graph with m edges has a vertex-partition into k sets such that each set contains at most (1+o(1)) mΓ‚k 3 edges. We also consider related problems and conjecture a more general result. 1997 Academic Press

Transversal partitioning in balanced hyp
Transversal partitioning in balanced hypergraphs
✍ Elias Dahlhaus; Jan KratochvΓ­l; Paul D. Manuel; Mirka Miller πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 958 KB

A transversal of a hypergraph is a set of vertices meeting all the hyperedges. A k-fold transversal 52 of a hypergraph is a set of vertices such that every hyperedge has at least k elements of R. In this paper, we prove that a k-fold transversal of a balanced hypergraph can be expressed as a union o