pith. sign in

arxiv: 1003.5115 · v4 · pith:LKSTGQ7Jnew · submitted 2010-03-26 · 🧮 math.GN · math.AT· math.CO

Cycle decompositions: from graphs to continua

classification 🧮 math.GN math.ATmath.CO
keywords continuacyclegraphhomologycyclesgraphsgroupreplace
0
0 comments X
read the original 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 $H_1$. This homology seems to be particularly apt for studying spaces with infinitely generated $H_1$, e.g. infinite graphs or fractals.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.