Matroid and Tutte-connectivity in infinite graphs
Combinatorics
2012-10-25 v1
Abstract
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that the two cycle matroids, the finite-cycle matroid and the cycle matroid, in which also infinite cycles are taken into account, have the same connectivity function. As an application we re-prove that, also for infinite graphs, Tutte-connectivity is invariant under taking dual graphs.
Keywords
Cite
@article{arxiv.1210.6380,
title = {Matroid and Tutte-connectivity in infinite graphs},
author = {Henning Bruhn},
journal= {arXiv preprint arXiv:1210.6380},
year = {2012}
}
Comments
11 pages