In this paper, the following results are obtained: and all bounds are sharp, where p= IV(G)/, [xl denotes the smallest integer greater than or equal to x, a(G) is the vertex arboricity, a'(G) is the edge arboricity, r'(G) is the edge covering number, p(G) is the vertex independent number, j?'(G) is
The covering number and the transitive covering number may be totally different
β Scribed by Jan Kraszewski
- Book ID
- 111570768
- Publisher
- Akadmiai Kiad
- Year
- 2004
- Tongue
- English
- Weight
- 173 KB
- Volume
- 105
- Category
- Article
- ISSN
- 1588-2632
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch
A reault of J. MYCIELSIZI ssp that on every metric space (X, e) with a non-empty compact thick set C X there exists a repbr open-invsriant BOREL measure p with p(C) = 1. p is mlled open-invariant if p(A) = p(B) for open isometric sets A, 3 X. We relste this result to the notion of a Hrrwm~-S~~omms~
## Abstract Let __f, g__ β ^__Ο__^ __Ο__ . We will denote by __g__ β« __f__ that for every __k__ < __Ο__, __f__ (__n__ ^__k__^ ) β€ __g__ (__n__ ) except for finitely many __n__ . The ideal β~__f__~ on ^__Ο__^ 2 is the collection of sets __X__ such that, for some __g__ β« __f__ and __Ο__ β β~__n__ <_