On the number of group-weighted matchings

DOI10.1023/A:1008671206536zbMath0899.05042OpenAlexW1554080308MaRDI QIDQ1386528

Roy Meshulam, Jeffry Kahn

Publication date: 28 October 1998

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

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

zbMATH Keywords

digraphgroup algebrabipartite matchingfinite abelian groupOlson's theorem

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An uncertainty inequality and zero subsums
• Some intersection theorems on two-valued functions
• Some intersection theorems for ordered sets and graphs
• Diophantine problems in variables restricted to the values 0 and 1
• Group weighted matchings in bipartite graphs
• Representations of families of triples over \(GF(2)\)
• A combinatorial problem on finite Abelian groups. I
• Anticlusters and intersecting families of subsets

This page was built for publication: On the number of group-weighted matchings