Abstract
In this paper, we prove that any simple and cosimple connected binary matroid has at least four connected hyperplanes. We further prove that each element in such a matroid is contained in at least two connected hyperplanes. Our main result generalizes a matroid result of Kelmans, and independently, of Seymour. The following consequence of the main result generalizes a graph result of Thomassen and Toft on induced non-separating cycles and another graph result of Kaugars on deletable vertices. If G is a simple 2-connected graph with minimum degree at least 3, then, for every edge e , there are at least two induced non-separating cycles avoiding e and two deletable vertices non-incident to e . Moreover, G has at least four induced non-separating cycles.
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 callDisclaimer: 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.
