An Erdős-Gallai theorem for matroids

DOI10.1007/s00026-011-0123-4zbMath1244.05048OpenAlexW1975383632MaRDI QIDQ434226

Sean McGuinness

Publication date: 10 July 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-011-0123-4

zbMATH Keywords

minormatroidbinary matroid

Mathematics Subject Classification ID

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

Related Items (1)

Binary matroids with no 4-spike minors

Cites Work

• An Erdős-Gallai conjecture
• Decomposition of regular matroids
• A decomposition theorem for partially ordered sets
• A sharp bound on the size of a connected matroid
• Cycle and cocycle coverings of graphs
• An Upper Bound on the Number of Edges of a 2-Connected Graph
• On maximal paths and circuits of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Erdős-Gallai theorem for matroids