✦ LIBER ✦

Hall's theorem for hypergraphs

✍ Scribed by Ron Aharoni; Penny Haxell

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 89 KB
Volume: 35
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200010)35:2<83::aid-jgt2>3.0.co;2-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 2-Isomorphism Theorem for Hypergraphs

✍ Dirk Vertigan; Geoff Whittle 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 330 KB

One can associate a polymatroid with a hypergraph that naturally generalises the cycle matroid of a graph. Whitney's 2-isomorphism theorem characterises when two graphs have isomorphic cycle matroids. In this paper Whitney's theorem is generalised to hypergraphs and polymatroids by characterising wh

Chromatic Index of Hypergraphs and Shann

Chromatic Index of Hypergraphs and Shannon’s Theorem

✍ Tomáš Dvořák 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 85 KB

A classical theorem of Claude Shannon states that for any multigraph G without loops, χ (G) ≤ 3 2 (G) . We suggest a generalization of Shannon's theorem to hypergraphs and prove it in case of hypergraphs without repeated edges of size 2.

Edge list multicoloring trees: An extens

Edge list multicoloring trees: An extension of Hall's theorem

✍ Mathew Cropper; András Gyárfás; Jenő Lehel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

## Abstract We prove a necessary and sufficient condition for the existence of edge list multicoloring of trees. The result extends the Halmos–Vaughan generalization of Hall's theorem on the existence of distinct representatives of sets. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 246–255, 20

From Hall's Matching Theorem to Optimal

From Hall's Matching Theorem to Optimal Routing on Hypercubes

✍ Shuhong Gao; Beth Novick; Ke Qiu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 218 KB

We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the sets. It is shown that disjoint ordering is useful for network routing. More precisely, we show that Hall's ``marriage'' co

Interchange Theorems for Hypergraphs and

Interchange Theorems for Hypergraphs and Factorization of Their Degree Sequences

✍ A.A. Chernyak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 124 KB

The aim of this paper is to unify interchange theorems and extend them to hypergraphs. To this end sufficient conditions for equality of the l 1 -distance between equivalence classes and the l 1 -distance between corresponding order-type functions are provided. The generality of this result is demon

A Theorem on Pure States on a Hypergraph

✍ Peter G. Ovchinnikov 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB