Group weighted matchings in bipartite graphs

DOI10.1023/A:1022433630971zbMath0872.05040MaRDI QIDQ1804248

Ron Aharoni, Roy Meshulam, Bronisław Wajnryb

Publication date: 25 September 1997

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

abelian group; bipartite matching; edge labels

Mathematics Subject Classification ID

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

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

15B52: Random matrices (algebraic aspects)

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

05C20: Directed graphs (digraphs), tournaments

Related Items

On the number of group-weighted matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Disjoint cycles in digraphs
• An uncertainty inequality and zero subsums
• Diophantine problems in variables restricted to the values 0 and 1
• Special parity of perfect matchings in bipartite graphs
• A combinatorial problem on finite Abelian groups. I