An index theory for uniformly locally finite graphs
β Scribed by Joachim von Below
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 272 KB
- Volume
- 431
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract By a result of Gallai, every finite graph __G__ has a vertex partition into two parts each inducing an element of its cycle space. This fails for infinite graphs if, as usual, the cycle space is defined as the span of the edge sets of finite cycles in __G__. However, we show that, for t
Let v β₯ k β₯ 1 and k β₯ 0 be integers. Recall that a (v, k, k) block design is a collection B of k-subsets of a v-set X in which every unordered pair of elements in X is contained in exactly k of the subsets in B. Now let G be a graph with no multiple edges. A (v, G, k) graph design is a collection H