Waste less time on Facebook — follow Brilliant.
×

Hall's theorem

Let G be a bipartite graph with vertex sets X,Y such that ∀S⊆X,|N(S) |>|S|. Show that every edge of G extends to a matching from X to Y.

Note by Maxim Kasnedelchev
2 months ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

ok

Maxim Kasnedelchev - 1 month ago

Log in to reply

fuck you brilliant

Maxim Kasnedelchev - 1 month ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...