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

DOI10.1016/j.jctb.2008.08.004zbMath1229.05071OpenAlexW2088312182MaRDI QIDQ1003843

Jim Geelen, Kasper Kabell

Publication date: 4 March 2009

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.08.004

zbMATH Keywords

matroidscircuitsbicircular matroidsErdös-Pósa property

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (13)

Packing and Covering Immersion Models of Planar Subcubic Graphs ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ The structure of matroids with a spanning clique or projective geometry ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ Some open problems on excluding a uniform matroid ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ Strengthening Erdös-Pósa property for minor-closed graph classes ⋮ Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles ⋮ A characterization of tangle matroids ⋮ Projective geometries in exponentially dense matroids. I. ⋮ Projective geometries in exponentially dense matroids. II.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognizing graphic matroids
• Disjoint cocircuits in matroids with large rank
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• A class of geometric lattices based on finite groups
• THE LONG-LINE GRAPH OF A COMBINATORIAL GEOMETRY. I. EXCLUDING M(K₄) AND THE (q + 2)-POINT LINE AS MINORS
• On Independent Circuits Contained in a Graph

This page was built for publication: The Erdös-Pósa property for matroid circuits