𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the -strong chromatic number of -intersecting hypergraphs

✍ Scribed by Chung, Ping Ngai

Book ID
121904480
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
391 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Strong total chromatic numbers of comple
Strong total chromatic numbers of complete hypergraphs
✍ Peter Cowling πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 227 KB

We determine the strong total chromatic number of the complete h-uniform hypergraph Kh, and the complete h-partite hypergraph K,\* ............ .

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
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