Matroid T-connectivity

J.F. Geelen, A.M.H. Gerards, G. Whittle

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)
67 Downloads (Pure)


We introduce a new generalization of the maximum matching problem to matroids; this problem includes Gallai's $T$-path problem for graphs.
Original languageEnglish
Pages (from-to)588-596
JournalSIAM Journal on Discrete Mathematics
Issue number3
Publication statusPublished - 2006

Fingerprint Dive into the research topics of 'Matroid T-connectivity'. Together they form a unique fingerprint.

Cite this