The number of elements belonging to triads in 3-connected binary matroids

DOI10.1016/j.disc.2015.08.014zbMath1322.05035OpenAlexW1276123004MaRDI QIDQ501058

Antonio José Ferreira jun. Gomes, Manoel Lemos

Publication date: 8 October 2015

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

Full work available at URL: https://doi.org/10.1016/j.disc.2015.08.014

zbMATH Keywords

trianglematroid3-connectedbinarytriad

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Cites Work

• Unnamed Item
• Inequivalent representations of matroids over prime fields
• Towards a splitter theorem for internally 4-connected binary matroids. IV
• Towards a splitter theorem for internally 4-connected binary matroids. V
• An upgraded Wheels-and-Whirls theorem for 3-connected matroids
• Clonal sets in \(GF(q)\)-representable matroids
• On the number of triangles in 3-connected matroids
• Internally 4-connected binary matroids with cyclically sequential orderings
• Elements belonging to triads in 3-connected matroids
• Elements belonging to triangles in 3-connected matroids
• Towards a splitter theorem for internally 4-connected binary matroids. II
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• ON MATROID CONNECTIVITY
• On elements in small cocircuits in minimally \(k\)-connected graphs and matroids

This page was built for publication: The number of elements belonging to triads in 3-connected binary matroids