Abstract

In this paper, we prove a conjecture proposed by Leo: a large minimally 3-connected matroid M has at least (5| E( M)|+30)/9 of its elements belonging to some triad. A bound on the number of elements belonging to triads of a 3-connected matroid which is close to be minimally 3-connected is also given. Both of these bounds are sharp and infinite families of matroids attaining them are constructed. A new proof of results of Lemos and Leo about triads meeting circuits with at most one removable element in 3-connected matroids is given.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.