Internally 4-connected binary matroids with every element in three triangles (Q2338614)

From MaRDI portal
Revision as of 06:46, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Internally 4-connected binary matroids with every element in three triangles
scientific article

    Statements

    Internally 4-connected binary matroids with every element in three triangles (English)
    0 references
    0 references
    0 references
    21 November 2019
    0 references
    The purpose of this paper is to prove that a binary internally 4-connected matroid \(M\) in which every element is in exactly three triangles has at least four elements \(e\) such that the simplification of \(M/e\), si\((M/e)\), is internally 4-connected. This theorem is first proved for matroids on at most thirteen elements. Then a sequence of lemmas is proved dealing with small cocircuits. The proof of the theorem follows then easily and elegantly. Moreover, an examle of a matroid \(M\) satisfying the hypothesis of the theorem is constructed in which si\((M/e)\) is not internally 4-connected for every \(e\).
    0 references
    binary matroid
    0 references
    internally 4-connected matroid
    0 references
    clutter
    0 references
    triad
    0 references
    triangle
    0 references

    Identifiers