The Erdös-Pósa property for matroid circuits

نویسندگان

  • James F. Geelen
  • Kasper Kabell
چکیده

The number of disjoint cocircuits in a matroid is bounded by its rank. There are, however, matroids with arbitrarily large rank that do not contain two disjoint cocircuits; consider, for example, M(Kn) and Un,2n. Also the bicircular matroids B(Kn) have arbitrarily large rank and have no 3 disjoint cocircuits. We prove that for each k and n there exists a constant c such that, if M is a matroid with rank at least c, then either M has k disjoint cocircuits or M contains a Un,2n-, M(Kn)-, or B(Kn)-minor.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular matroids without disjoint circuits

A cosimple regular matroid M does not have disjoint circuits if and only ifM ∈ {M(K3,3),M(Kn) (n ≥ 3)}. This extends a former result of Erdös and Pósa on graphs without disjoint circuits.

متن کامل

Disjoint cocircuits in matroids with large rank

We prove that, for any positive integers n; k and q; there exists an integer R such that, if M is a matroid with no MðKnÞor U2;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. r 2002 Elsevier Science (USA). All rights reserved. AMS 1991 ...

متن کامل

The Erdős-Pósa Property for Long Circuits

Let G be a graph and F a family of graphs. A transversal of F is a set X of vertices of G such that G−X contains no member of F . The family F is said to have the Erdős–Pósa property if there exists a function f :N→N such that every graph G contains either k vertex-disjoint members of F or a transversal of F of size at most f(k). This concept originated in [6], where Erdős and Pósa established ...

متن کامل

Strengthening Erdös-Pósa property for minor-closed graph classes

Let H and G be graph classes. We say that H has the Erd”os–Pósa property for G if for any graph G∈G, the minimum vertex covering of all H-subgraphs of G is bounded by a function f of the maximum packing of H-subgraphs in G (by H-subgraph of G we mean any subgraph of G that belongs to H). Robertson and Seymour [J Combin Theory Ser B 41 (1986), 92–114] proved that if H is the class of all graphs ...

متن کامل

The Half-integral Erdös-Pósa Property for Non-null Cycles

A Group Labeled Graph is a pair (G,Λ) where G is an oriented graph and Λ is a mapping from the arcs of G to elements of a group. A (not necessarily directed) cycle C is called non-null if for any cyclic ordering of the arcs in C, the group element obtained by ‘adding’ the labels on forward arcs and ‘subtracting’ the labels on reverse arcs is not the identity element of the group. Non-null cycle...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 99  شماره 

صفحات  -

تاریخ انتشار 2009