Matchings with Prescribed Color Counts

Popescu, Tudor · arXiv (Cornell University) · 2025

In this note, we prove an interesting result about perfect matchings in a complete bipartite graph with 2n vertices on each side, whose edges are colored in red and blue such that each vertex is part of n red edges and n blue edges.

Read the paper · More papers on PaperTik