Matchings with Prescribed Color Counts
Combinatorics
2025-08-11 v1
Abstract
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.
Cite
@article{arxiv.2508.06211,
title = {Matchings with Prescribed Color Counts},
author = {Tudor Popescu},
journal= {arXiv preprint arXiv:2508.06211},
year = {2025}
}