Group weighted matchings in bipartite graphs

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

Bronisław Wajnryb, Roy Meshulam, Ron Aharoni

Publication date: 25 September 1997

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

Full work available at URL: https://doi.org/10.1023/a:1022433630971

zbMATH Keywords

abelian groupbipartite matchingedge labels

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random matrices (algebraic aspects) (15B52) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

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

This page was built for publication: Group weighted matchings in bipartite graphs