Matroid and Tutte-connectivity in infinite graphs (Q405204): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C63 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05B35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6340181 / rank
 
Normal rank
Property / zbMATH Keywords
 
connectivity
Property / zbMATH Keywords: connectivity / rank
 
Normal rank
Property / zbMATH Keywords
 
infinite graphs
Property / zbMATH Keywords: infinite graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
infinite matroids
Property / zbMATH Keywords: infinite matroids / rank
 
Normal rank

Revision as of 17:17, 29 June 2023

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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references