𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cutsets and partitions of hypergraphs

✍ Scribed by E. L. Lawler

Publisher
John Wiley and Sons
Year
1973
Tongue
English
Weight
510 KB
Volume
3
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Judicious Partitions of 3-uniform Hyperg
Judicious Partitions of 3-uniform Hypergraphs
✍ B. BollobΓ‘s; A.D. Scott πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 113 KB

A conjecture of BollobΓ‘s and Thomason asserts that, for r β‰₯ 1, every r -uniform hypergraph with m edges can be partitioned into r classes such that every class meets at least rm/(2r -1) edges. BollobΓ‘s, Reed and Thomason [3] proved that there is a partition in which every edge meets at least (1 -1/e

Extremal Problems for Sets Forming Boole
Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs
✍ David S. Gunderson; VojtΔ›ch RΓΆdl; Alexander Sidorenko πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 209 KB

Three classes of finite structures are related by extremal properties: complete d-partite d-uniform hypergraphs, d-dimensional affine cubes of integers, and families of 2 d sets forming a d-dimensional Boolean algebra. We review extremal results for each of these classes and derive new ones for Bool

Generation of vertex and edge cutsets
Generation of vertex and edge cutsets
✍ V.C. Prasad; V. Sankar; K.S. Prakasa Rao πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 591 KB