Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.06211 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912527527444480 |
|---|---|
| author | Popescu, Tudor |
| author_facet | Popescu, Tudor |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_06211 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Matchings with Prescribed Color Counts Popescu, Tudor Combinatorics 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. |
| title | Matchings with Prescribed Color Counts |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2508.06211 |