For each pair k, rn of natural numbers there exists a natural number f(k, rn) such that every f ( k , m)-chromatic graph contains a k-connected subgraph of chromatic number at least rn.
Connectivity and chromatic number of infinite graphs
✍ Scribed by Péter Komjáth
- Book ID
- 112891599
- Publisher
- The Hebrew University Magnes Press
- Year
- 1986
- Tongue
- English
- Weight
- 429 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0021-2172
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract The fractional chromatic number of a graph __G__ is the infimum of the total weight that can be assigned to the independent sets of __G__ in such a way that, for each vertex __v__ of __G__, the sum of the weights of the independent sets containing __v__ is at least 1. In this note we g
We wrote many papers on these subjects, some in collaboration with Galvin, Rado, Shelah and Szemer6di, and posed many problems some of which turned out to be undecidable. In this survey we state some old and new solved and unsolved problems. Nous avons 6crit beaucoup d'articles, certains en collabo