A compactness theorem for perfect matchings in matroids

DOI10.1016/0095-8956(88)90035-4zbMath0681.05017OpenAlexW2072683253MaRDI QIDQ1823249

Yanyan Li

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90035-4

zbMATH Keywords

edge coveringedge-disjoint circuitsfinite matching extendible matroid

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

On generalisations of the Aharoni–Pouzet base exchange theorem ⋮ Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets

Cites Work

• Unnamed Item
• Unnamed Item
• A compactness result for perfect matchings
• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• Vertex-transitive graphs
• Decomposition of Graphs Into Closed and Endless Chains
• A General Criterion for the Existence of Transversals

This page was built for publication: A compactness theorem for perfect matchings in matroids