Detecting minors in matroids through triangles

DOI10.1016/J.EJC.2015.10.010zbMATH Open1328.05178arXiv1412.4982OpenAlexW309000119MaRDI QIDQ901153FDOQ901153

Authors: Boris Albar, Daniel Gonçalves, Jorge Luis Ramírez Alfonsín 

Publication date: 23 December 2015

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

Abstract: In this note we investigate some matroid minor structure results. In particular, we present sufficient conditions, in terms of {em triangles}, for a matroid to have either $U_{2,4}$ or $F_7$ or $M(K_5)$ as a minor.

Full work available at URL: https://arxiv.org/abs/1412.4982

Recommendations

• Triangles in 3-connected matroids
• On graphic matroid minors that guarantee their duals as minors
• Minors of 3-connected matroids
• On the structure of triangle-free 3-connected matroids
• scientific article; zbMATH DE number 1303530

zbMATH Keywords

matroid minor structure

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)

Cites Work

• Decomposition of regular matroids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Homomorphiesätze für Graphen
• A Combinatorial Model for Series-Parallel Networks
• Matroids and multicommodity flows
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
• On embeddability and stresses of graphs

Cited In (1)

• On the structure of triangle-free 3-connected matroids

This page was built for publication: Detecting minors in matroids through triangles

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