Matroid T‐Connectivity

DOI10.1137/050634190zbMATH Open1122.05023OpenAlexW2073915946MaRDI QIDQ5757375FDOQ5757375

Authors: Jim Geelen, Bert Gerards, Geoff Whittle 

Publication date: 6 September 2007

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050634190

zbMATH Keywords

matchingpathsconnectivitymatroidsGallai's \(T\)-paths theorem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (8)

• Contracting an element from a cocircuit
• When excluding one matroid prevents infinite antichains
• Branch-depth: generalizing tree-depth of graphs
• Inequivalent representations of matroids over prime fields
• Title not available (Why is that?)
• A splitter theorem for 3-connected 2-polymatroids
• Connected matroids with symmetric Tutte polynomials
• A matroid extension result

This page was built for publication: Matroid T‐Connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757375)