Maximal tight sets and the Edmonds-Gallai decomposition for matchings

DOI10.1007/BF02579252zbMath0608.05064MaRDI QIDQ1086254

B. George

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

matchings; infinite graphs; locally finite graphs; Edmonds-Gallai decomposition theorem; infinite paths; maximal matchable sets; maximal tight sets

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C75: Structural characterization of families of graphs