Matroid and Tutte-connectivity in infinite graphs (Q405204)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Matroid and Tutte-connectivity in infinite graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matroid and Tutte-connectivity in infinite graphs |
scientific article |
Statements
Matroid and Tutte-connectivity in infinite graphs (English)
0 references
4 September 2014
0 references
Summary: 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.
0 references
connectivity
0 references
infinite graphs
0 references
infinite matroids
0 references
0.8982290625572205
0 references
0.8345355987548828
0 references
0.834272563457489
0 references
0.7965721487998962
0 references
