A bipartite graph is a graph whose vertices can be divided into two disjoint sets such that no two vertices in the same set are adjacent.
Stats
created |
10 months ago |
viewed |
3 times |
editors |
0 |
Top Answerers
more »Recent Hot Answers
Gale-Ryser stable marriage theorem: can we entrust matchmaking to monkeys?Gale-Ryser stable marriage theorem: can we entrust matchmaking to monkeys?
Condition on a bipartite graph to have an $m$-factor
Polygamous stable marriage/ assignment problem
Good lower bound on matching in bipartite graph
more »
Related Tags
graph-theory × 21
co.combinatorics × 13
matching-theory × 7
algorithms × 3
lower-bounds × 2
more related tags