On chains of 3-connected matroids (Q1086571): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple theorem on 3-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matroid connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of 3-connected graphs containing a given graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial matroid representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Menger's theorem for matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity in Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Revision as of 17:11, 17 June 2024

scientific article
Language Label Description Also known as
English
On chains of 3-connected matroids
scientific article

    Statements

    On chains of 3-connected matroids (English)
    0 references
    0 references
    0 references
    1986
    0 references
    A sequence \(N_ 0,N_ 1,...,N_ m\) of 3-connected matroids is called a chain from \(N_ 0\) to \(N_ m\) if each of \(N_ 0,N_ 1,...,N_{m-1}\) is a minor of its successor. The gap of such a chain is \(\max \{| E(N_ i)| -| E(N_{i-1})|:\) \(i=1,2,...,m\}\). A result of \textit{K. Truemper} [Eur. J. Comb. 5, 377-394 (1984; Zbl 0561.05018)] shows that if N is a 3-connected minor of a 3-connected matroid M, then there is always a chain from N to M of gap at most three and this paper proves several extensions of Truemper's result. In particular, the authors show that the chain of gap at most three from N to M may be chosen so that each term is obtained from its successor by a single-element contraction followed by a simplification, or by a single-element deletion followed by a cosimplification. In addition, they prove that, provided N has no circuits or cocircuits of size less than four, one may find a chain whose gap is at most two.
    0 references
    3-connected matroids
    0 references
    chain
    0 references
    3-connected minor
    0 references

    Identifiers