✦ LIBER ✦

Chromatic Coefficients of Linear Uniform Hypergraphs

✍ Scribed by Ioan Tomescu

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 224 KB
Volume: 72
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1997.1811

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On line graphs of linear 3-uniform hyper

On line graphs of linear 3-uniform hypergraphs

✍ Metelsky, Yury; Tyshkevich, Regina 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

It is known that the class of line graphs of linear 3-uniform hypergraphs cannot be characterized by a finite list of forbidden induced subgraphs (R. N.

On the Degree, Size, and Chromatic Index

On the Degree, Size, and Chromatic Index of a Uniform Hypergraph

✍ Noga Alon; Jeong Han Kim 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the maximum degree of a vertex of H. We conjecture that for every =>0, if D is sufficiently large as a function of t, k, and =, then the chromatic index of H is at most (t&1+1Ât+=) D. We prove t

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

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.

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

Chromatic numbers of hypergraphs and cov

Chromatic numbers of hypergraphs and coverings of graphs

✍ Zevi Miller; Heinrich Müller 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

Burr recently proved [3] that for positive integers m , , m 2 , . . , , m, and any graph G we have x(G) 5 &, if and only if G can be expressed as the edge disjoint union of subgraphs F, satisfying x(F,) 5 m,. This theorem is generalized to hypergraphs. By suitable interpretations the generalization