A compactness theorem for perfect matchings in matroids

DOI10.1016/0095-8956(88)90035-4MaRDI QIDQ1823249zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A compactness result for perfect matchings
• INFINITE MATROIDAL VERSION OF HALL'S MATCHING THEOREM
• scientific article; zbMATH DE number 3150
• scientific article; zbMATH DE number 434908
• scientific article; zbMATH DE number 4025456

Cites work

• A compactness result for perfect matchings
• A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
• A General Criterion for the Existence of Transversals
• Decomposition of Graphs Into Closed and Endless Chains
• scientific article; zbMATH DE number 3645097 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• Vertex-transitive graphs

Cited in

(5)

• A compactness result for perfect matchings
• Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets
• INFINITE MATROIDAL VERSION OF HALL'S MATCHING THEOREM
• On generalisations of the Aharoni–Pouzet base exchange theorem
• Circuit-partition of infinite matroids

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823249)