𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hypergraphs with high chromatic number

✍ Scribed by Noga Alon

Book ID
110567499
Publisher
Springer Japan
Year
1985
Tongue
English
Weight
123 KB
Volume
1
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The circular chromatic number of hypergr
The circular chromatic number of hypergraphs
✍ Richard C. Brewster; Gary MacGillivray; Laura Shepherd πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 556 KB
Oriented hypergraphs, stability numbers
Oriented hypergraphs, stability numbers and chromatic numbers
✍ Heinrich MΓΌller πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 232 KB

Oriented hypergraphs are defined, so that it is possible to genc&ze popositions characterizing the chromatic number and the stability number of a graph by means of crientations i!tnd elementary paths, to the strong and weak chromatic number and the strong and we& stability number of a hypergraph.

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