An Erdős-Gallai theorem for matroids
type: Item
instance of: scholarly article
title: An Erdős-Gallai theorem for matroids
zbMATH Open document ID: 1244.05048
author: Sean McGuinness
published in: Annals of Combinatorics
publication date: 2012-07-10T00:00:00Z
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05D15
zbMATH DE Number: 6053957
zbMATH Keywords: matroid
zbMATH Keywords: binary matroid
zbMATH Keywords: minor
MaRDI profile type: Publication
full work available at URL: s00026-011-0123-4
OpenAlex ID: W1975383632
cites work: Q4552141
cites work: Q3097395
cites work: A decomposition theorem for partially ordered sets
cites work: On maximal paths and circuits of graphs
cites work: A sharp bound on the size of a connected matroid
cites work: Cycle and cocycle coverings of graphs
cites work: Q3135082
cites work: An Erdős-Gallai conjecture
cites work: Decomposition of regular matroids
cites work: An Upper Bound on the Number of Edges of a 2-Connected Graph
DOI: 10.1007/S00026-011-0123-4
Recommended article: Menger's theorem for matroids
Recommended article: A Tverberg type theorem for matroids
Recommended article: A matroid generalization of theorems of Lewin and Gallai
Recommended article: Q4337876
Recommended article: A matroid analogue of a theorem of Brooks for graphs
Recommended article: Q3972011
Recommended article: The Erdös-Pósa property for matroid circuits
Recommended article: A chain theorem for matroids
Recommended article: A Cantor-Bernstein theorem for infinite matroids
Recommended article: On a generalization of the matroid
description: scientific article; zbMATH DE number 6053957