A sharp bound on the size of a connected matroid

DOI10.1090/S0002-9947-01-02767-2zbMath0971.05034OpenAlexW2160456540MaRDI QIDQ2723463

Manoel Lemos, James G. Oxley

Publication date: 5 July 2001

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-01-02767-2

zbMATH Keywords

connected matroidmatroid Ramsey numbers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Inequivalent representations of matroids over prime fields, Capturing matroid elements in unavoidable 3-connected minors, An Erdős-Gallai theorem for matroids, Branch-depth: generalizing tree-depth of graphs, On cocircuit covers of bicircular matroids, Relations between the circumference and \(e\)-circumference of a matroid, The 3-connected matroids with circumference 6, Circuit and fractional circuit covers of matroids, Large Wk- or K3,t-Minors in 3-Connected Graphs, Unavoidable Connected Matroids Retaining a Specified Minor, The 3-connected binary matroids with circumference 6 or 7, Families of matroids induced by classes of graphs, Matroid packing and covering with circuits through an element, Special issue in honour of James Oxley

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of regular matroids
• \(k\)-elimination property for circuits of matroids
• The matroids with the max-flow min-cut property
• Ramsey numbers for matroids
• On two intersecting set systems and k-continuous Boolean functions
• Constructing trees in bipartite graphs
• An Upper Bound on the Number of Edges of a 2-Connected Graph
• On the width—length inequality
• The Matroid Ramsey Number n(6,6)
• Some Small Circuit-Cocircuit Ramsey Numbers for Matroids
• On the Number of Elements in Matroids with Small Circuits or Cocircuits
• Lectures on matroids