Infinite matroidal version of Hall's matching theorem

• Autores: Jerzy Wojciechowski
• Localización: Journal of the London Mathematical Society, ISSN 0024-6107, Vol. 71, Nº 3, 2005, págs. 563-578
• Idioma: inglés
• DOI: 10.1112/s0024610705006320
• Texto completo no disponible (Saber más ...)
• Resumen

  • Hall's theorem for bipartite graphs gives a necessary and sufficient condition for the existence of a matching in a given bipartite graph. Aharoni and Ziv have generalized the notion of matchability to a pair of possibly infinite matroids on the same set and given a condition that is sufficient for the matchability of a given pair of finitary matroids, where the matroid is SCF (a sum of countably many matroids of finite rank). The condition of Aharoni and Ziv is not necessary for matchability. The paper gives a condition that is necessary for the existence of a matching for any pair of matroids (not necessarily finitary) and is sufficient for any pair of finitary matroids, where the matroid is SCF.