Matroid and Tutte-connectivity in infinite graphs (Q405204): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 1210.6380 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Thin sums matroids and duality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The structure of 2-separations of infinite matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matroid intersection, base packing and base covering for infinite matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matroids with an infinite circuit-cocircuit intersection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Duality in Infinite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Infinite matroids in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Axioms for infinite matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Duality of Ends / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite connectivity in infinite matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3577833 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592133 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matroids and duality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4012029 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity in Matroids / rank | |||
Normal rank |
Latest revision as of 23:49, 8 July 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