English

Cycle decompositions: from graphs to continua

General Topology 2011-10-28 v4 Algebraic Topology Combinatorics

Abstract

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and replace the cycle space of a graph by a new homology group for continua which is a quotient of the first singular homology group H1H_1. This homology seems to be particularly apt for studying spaces with infinitely generated H1H_1, e.g. infinite graphs or fractals.

Keywords

Cite

@article{arxiv.1003.5115,
  title  = {Cycle decompositions: from graphs to continua},
  author = {Agelos Georgakopoulos},
  journal= {arXiv preprint arXiv:1003.5115},
  year   = {2011}
}

Comments

Advances in Mathematics (2011)

R2 v1 2026-06-21T15:03:01.300Z