Maximal tight sets and the Edmonds-Gallai decomposition for matchings

DOI10.1007/BF02579252zbMath0608.05064OpenAlexW2022990157MaRDI QIDQ1086254

B. George

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579252

zbMATH Keywords

matchingsinfinite graphslocally finite graphsEdmonds-Gallai decomposition theoreminfinite pathsmaximal matchable setsmaximal tight sets

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (2)

Graph factors and factorization: 1985--2003: a survey ⋮ LP duality in infinite hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On an obstruction for perfect matchings
• A generalization of Tutte's 1-factor theorem to countable graphs
• The Edmonds-Gallai decomposition for matchings in locally finite graphs
• Paths, Trees, and Flowers
• On the structure of factorizable graphs
• On factorisation of graphs

This page was built for publication: Maximal tight sets and the Edmonds-Gallai decomposition for matchings