Group weighted matchings in bipartite graphs

DOI10.1023/A:1022433630971zbMATH Open0872.05040OpenAlexW51758890MaRDI QIDQ1804248FDOQ1804248

Authors: Ron Aharoni, Roy Meshulam, Bronisław Wajnryb 

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

Recommendations

• On the number of group-weighted matchings
• Low weight perfect matchings
• Perfect matchings and derangements on graphs
• On the number of perfect matchings in a bipartite graph
• Optimum matchings in weighted bipartite graphs

zbMATH Keywords

abelian groupbipartite matchingedge labels

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An uncertainty inequality and zero subsums
• A combinatorial problem on finite Abelian groups. I
• Title not available (Why is that?)
• Diophantine problems in variables restricted to the values 0 and 1
• Disjoint cycles in digraphs
• Special parity of perfect matchings in bipartite graphs

Cited In (3)

• On the number of group-weighted matchings
• Optimum matchings in weighted bipartite graphs
• Perfect matchings as IID factors on non-amenable groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804248)