Improving a chain theorem for triangle-free 3-connected matroids

DOI10.1016/j.ejc.2017.09.005zbMath1376.05032OpenAlexW2766024715MaRDI QIDQ1686252

Manoel Lemos

Publication date: 21 December 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2017.09.005

zbMATH Keywords

contractionminorirreducible matroidstriangle-free 3-connected graphs

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

On the structure of triangle-free 3-connected matroids

Cites Work

• Unnamed Item
• Towards a splitter theorem for internally 4-connected binary matroids. III
• Towards a splitter theorem for internally 4-connected binary matroids. IV
• Towards a splitter theorem for internally 4-connected binary matroids. V
• Towards a splitter theorem for internally 4-connected binary matroids
• A chain theorem for 4-connected matroids
• A chain theorem for internally 4-connected binary matroids
• A constructive characterization of 3-connected triangle-free graphs
• Decomposition of regular matroids
• Extensions of Tutte's wheels-and-whirls theorem
• Matroid 4-connectivity: A deletion-contraction theorem
• On triangle-free 3-connected matroids
• Towards a splitter theorem for internally 4-connected binary matroids. II
• A chain theorem for matroids
• The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
• Connectivity in Matroids
• A Splitter Theorem for Internally 4‐Connected Binary Matroids