𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The chromatic index of simple hypergraphs

✍ Scribed by Z. Füredi

Book ID
105309255
Publisher
Springer Japan
Year
1986
Tongue
English
Weight
192 KB
Volume
2
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Chromatic polynomials of hypergraphs
Chromatic polynomials of hypergraphs
✍ Ewa Drgas-Burchardt; Ewa Łazuka 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 182 KB

We consider a natural generalization of the chromatic polynomial of a graph. Let the symbol f (x 1 ,...,x m ) (H, λ) denote a number of different λ-colourings of a hypergraph H = (X, E), where X = {v 1 , . . . , v n } and E = {e 1 , . . . , e m }, satisfying that in an edge e i there are used at lea

The Chromatic Spectrum of Mixed Hypergra
The Chromatic Spectrum of Mixed Hypergraphs
✍ Tao Jiang; Dhruv Mubayi; Zsolt Tuza; Vitaly Voloshin; Douglas B. West 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 131 KB
The chromatic numbers of random hypergra
The chromatic numbers of random hypergraphs
✍ Michael Krivelevich; Benny Sudakov 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB 👁 1 views

For a pair of integers 1 F ␥r, the ␥-chromatic number of an r-uniform Ž . hypergraph H s V, E is the minimal k, for which there exists a partition of V into subsets < < T, . . . , T such that e l T F ␥ for every e g E. In this paper we determine the asymptotic 1 k i Ž . behavior of the ␥-chromatic n

On chromaticity of hypergraphs
On chromaticity of hypergraphs
✍ Mieczysław Borowiecki; Ewa Łazuka 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 181 KB