On the 3-connected matroids that are minimal having a fixed restriction

DOI10.1007/PL00007223zbMATH Open0965.05032OpenAlexW1970913569MaRDI QIDQ1586582FDOQ1586582

Authors: Manoel Lemos, Talmage James Reid, James Oxley 

Publication date: 14 November 2000

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00007223

Recommendations

• On the 3-connected matroids that are minimal having a fixed spanning restriction
• On packing minors into connected matroids
• On the minor-minimal 3-connected matroids having a fixed minor.
• On packing 3-connected restrictions into 3-connected matroids
• On 3-connected minors of 3-connected matroids and graphs

zbMATH Keywords

boundindependent setminimal pair3-conneted matroid3-conneted minor

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (4)

• Reconstruction of infinite matroids from their 3-connected minors
• On the minor-minimal 3-connected matroids having a fixed minor.
• Matroids with many common bases.
• On the 3-connected matroids that are minimal having a fixed spanning restriction

This page was built for publication: On the 3-connected matroids that are minimal having a fixed restriction

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