The circular chromatic number of hypergraphs
β Scribed by Richard C. Brewster; Gary MacGillivray; Laura Shepherd
- Book ID
- 108114047
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 556 KB
- Volume
- 309
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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.