𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The genus ofG-spaces and topological lower bounds for chromatic numbers of hypergraphs

✍ Scribed by A. Yu. Volovikov

Publisher
Springer US
Year
2007
Tongue
English
Weight
180 KB
Volume
144
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A topological lower bound for the circul
A topological lower bound for the circular chromatic number of Schrijver graphs
✍ Meunier, FrΓ©dΓ©ric (author) πŸ“‚ Article πŸ“… 2005 πŸ› Wiley-Liss Inc. 🌐 English βš– 66 KB πŸ‘ 1 views

## Abstract In this paper, we prove that the Kneser graphs defined on a ground set of __n__ elements, where __n__ is even, have their circular chromatic numbers equal to their chromatic numbers. Β© 2005 Wiley Periodicals, Inc. J Graph Theory 49: 257–261, 2005

New Lower Bounds for Ramsey Numbers of G
New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs
✍ Felix Lazebnik; Dhruv Mubayi πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 146 KB πŸ‘ 1 views

## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,