Matroid and Tutte-connectivity in infinite graphs (Q405204): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:10, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
