Disjoint cocircuits in matroids with large rank (Q1405119): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5342984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE LONG-LINE GRAPH OF A COMBINATORIAL GEOMETRY. I. EXCLUDING <i>M</i>(<i>K</i><sub>4</sub>) AND THE (<i>q</i> + 2)-POINT LINE AS MINORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank

Latest revision as of 09:20, 6 June 2024

scientific article
Language Label Description Also known as
English
Disjoint cocircuits in matroids with large rank
scientific article

    Statements

    Disjoint cocircuits in matroids with large rank (English)
    0 references
    0 references
    0 references
    0 references
    25 August 2003
    0 references
    To gain insight into minor-closed classes of GF\((q)\)-representable matroids that omit a given characteristic, the authors prove the following theorem: For any positive integers \(n, k\), and \(q\), there exists an integer \(R\) such that, if \(M\) is a matroid with no \(M(K_n)\)- or \(U_{2, q+2}\)-minor, then either \(M\) has a collection of \(k\) disjoint cocircuits or \(M\) has rank at most \(R\). Applied to the class of cographic matroids, this result implies the edge-disjoint version of the Erdős-Pósa theorem [see \textit{P. Erdős} and \textit{L. Pósa}, Publ. Math. 9, 3-12 (1962; Zbl 0133.16701)].
    0 references

    Identifiers