✦ LIBER ✦

A condition for matchability in hypergraphs

✍ Scribed by P. E. Haxell

Publisher: Springer Japan
Year: 1995
Tongue: English
Weight: 247 KB
Volume: 11
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01793010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a criterion for matchability in hyper

On a criterion for matchability in hypergraphs

✍ Ron Aharoni 📂 Article 📅 1993 🏛 Springer Japan 🌐 English ⚖ 168 KB

Hypergraphs, Quasi-randomness, and Condi

Hypergraphs, Quasi-randomness, and Conditions for Regularity

✍ Yoshiharu Kohayakawa; Vojtěch Rödl; Jozef Skokan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Haviland and Thomason and Chung and Graham were the first to investigate systematically some properties of quasi-random hypergraphs. In particular, in a series of articles, Chung and Graham considered several quite disparate properties of random-like hypergraphs of density 1/2 and proved that they a

Density Conditions for Panchromatic Colo

Density Conditions for Panchromatic Colourings of Hypergraphs

✍ Alexandr V. Kostochka; Douglas R. Woodall 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 356 KB

A separation algorithm for the matchable

A separation algorithm for the matchable set polytope

✍ William H. Cunningham; Jan Green-Krótki 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 820 KB

Independence in hypergraphs

✍ Yu. A. Sushkov 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 445 KB

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