Adjacency, inseparability, and base orderability in matroids (Q1568785): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4003411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientability of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on bases in dependence structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sign-invariance graphs of uniform oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on inseparability graphs of matroids having exactly one class of orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Common Transversals and Exchange Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for packing connectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concept of a vertex in a matroid and 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the ternary matroids with no \(M(K_ 4)\)-minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonbinary 3-Connected Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inseparability graphs of oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minors of 3-connected matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacency in binary matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triples in matroid circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Revision as of 15:54, 29 May 2024

scientific article
Language Label Description Also known as
English
Adjacency, inseparability, and base orderability in matroids
scientific article

    Statements

    Adjacency, inseparability, and base orderability in matroids (English)
    0 references
    28 August 2000
    0 references
    Two elements in an oriented matroid are inseparable if they have either the same sign in every signed circuit containing them both or opposite signs in every signed circuit containing them both. Two elements of a matroid are adjacent if there is no \({\mathcal M}(K_4)\)-minor using them both, and in which they correspond to a matching of \(K_4\). In this paper, the authors prove that two elements \(e\) and \(f\) of an oriented matroid are inseparable if and only if \(e, f\) are inseparable in every \({\mathcal M}(K_4)\) or \(U_4^2\)-minor containing them. This provides a link between inseparability in oriented matroids and adjacency in binary matroids. Furthermore, the authors define the concepts of base orderable and strongly base orderable subsets of a matroid, generalizing the notions of base orderable and strongly base orderable matroids. Strongly base orderable subsets can be used to obtain packing and covering results. In addition to the above, it is also proved that any pairwise inseparable subset of an oriented matroid is base orderable. For binary matroids, the authors derive the following characterization: a subset is strongly base orderable if and only if it is pairwise adjacent.
    0 references
    0 references
    matroid
    0 references
    oriented matroid
    0 references
    inseparable elements
    0 references
    adjacent elements
    0 references
    base orderable subsets
    0 references
    strongly base orderable subsets
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references