Grocery on Distributed Algorithms

T1: Some Facts on Matching (1)

Reminder: This post contains 93 words · 1 min read · by Xianbin

\(\textbf{Theorem 1}\). Every random regular bipartite graph admits a perfect matching.

To be continued ...