Finite matchability under the matroidal Hall's condition

DOI10.1016/J.JCTB.2024.02.006MaRDI QIDQ6500100zbMATH OpenFDO

Authors Attila Joó

Publication date 10 May 2024

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

zbMATH Keywords

matroid intersectioninfinite matroidmatroidal matching

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05Cxx) Mathematical programming (90Cxx)

Recommendations

• INFINITE MATROIDAL VERSION OF HALL'S MATCHING THEOREM
• Hall's theorem revisited
• scientific article; zbMATH DE number 490854
• A generalization of Hall's theorem for \(k\)-uniform \(k\)-partite hypergraphs
• On a possible extension of Hall's theorem to bipartite hypergraphs

Cites work

• scientific article; zbMATH DE number 3542436 (Why is no real title available?)
• scientific article; zbMATH DE number 1953186 (Why is no real title available?)
• Axioms for infinite matroids
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Infinite Matroids
• Infinite matching theory
• Matroid intersection, base packing and base covering for infinite matroids
• On an obstruction for perfect matchings
• On the intersection of infinite matroids
• Proof of Nash-Williams' intersection conjecture for countable matroids
• The Intersection of Two Infinite Matroids

This page was built for publication: Finite matchability under the matroidal Hall's condition

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