2025/08/08 by Tudor Popescu, Popescu, Tudor
Computer Science · #Combinatorics (math.CO) #FOS: Mathematics #Face and Expression Recognition
paper · pdf · doi:10.48550/arxiv.2508.06211
openalex publication_date 2025/08/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.