Question

Bipartite graph $G=(A,B)$ with $\delta(A)=3n/2$ and no $C_4$ has a matching which saturate each vertex in $A$.

score 254 · Answer 1 · 2026-03-24 23:56:09

254

Views

Bipartite graph $G=(A,B)$ with $\delta(A)=3n/2$ and no $C_4$ has a matching which saturate each vertex in $A$.

Published on 24 Mar 2026 - 23:56

score 4.2k · Answer 2 · 2018-05-25 17:13:42

4.2k

Views

Hall's theorem for bipartite graphs using König's theorem

Published on 25 May 2018 - 17:13

score 173 · Answer 3 · 2026-03-22 09:27:55

173

Views

What does the xor operator do in Stable matching

Published on 22 Mar 2026 - 9:27

score 33 · Answer 4 · 2018-06-18 05:55:30

33

Views

Prove that $A \in \mathcal{I}(\mathcal{A})$ and $B\subseteq A$ implies $B\in\mathcal{I}(\mathcal{A})$.

Published on 18 Jun 2018 - 5:55

score 265 · Answer 5 · 2026-03-22 16:11:52

265

Views

Condition for perfect matching in bipartite graphs

Published on 22 Mar 2026 - 16:11

score 1.6k · Answer 6 · 2018-07-18 21:20:56

1.6k

Views

A proof: a bipartite graph with 2n vertices whose largest independent set size is n has a perfect matching

Published on 18 Jul 2018 - 21:20

score 187 · Answer 7 · 2026-03-22 10:37:36

187

Views

find the maximal matching for a graph

Published on 22 Mar 2026 - 10:37

score 236 · Answer 8 · 2026-03-24 10:41:42

236

Views

Looking for name of combinatorial problem- Permute rows and columns to minimize distance to target matrix

Published on 24 Mar 2026 - 10:41

score 28 · Answer 9 · 2018-08-27 15:22:02

28

Views

Show that a connected simple graph for which every edge is in some perfect matching is a block

Published on 27 Aug 2018 - 15:22

score 614 · Answer 10 · 2026-03-22 10:21:32

614

Views

Example for Berge's theorem on matching

Published on 22 Mar 2026 - 10:21

score 105 · Answer 11 · 2018-09-01 18:15:32

105

Views

Conditions on Bipartite Graphs guaranteeing matchings

Published on 01 Sep 2018 - 18:15

score 1k · Answer 12 · 2026-03-22 14:16:57

1k

Views

How many malicious bingo cards are there?

Published on 22 Mar 2026 - 14:16

score 191 · Answer 13 · 2018-09-11 14:45:44

191

Views

Computing fixpoints of noncrossing matchings of $2n$ points under rotation.

Published on 11 Sep 2018 - 14:45

score 375 · Answer 14 · 2026-03-22 14:08:38

375

Views

Maximum number of edges in no 3-matching

Published on 22 Mar 2026 - 14:08

score 149 · Answer 15 · 2018-09-14 07:51:42

149

Views

Assignment problem with divisible tasks and hours

Published on 14 Sep 2018 - 7:51

List Question

Bipartite graph $G=(A,B)$ with $\delta(A)=3n/2$ and no $C_4$ has a matching which saturate each vertex in $A$.

Hall's theorem for bipartite graphs using König's theorem

What does the xor operator do in Stable matching

Prove that $A \in \mathcal{I}(\mathcal{A})$ and $B\subseteq A$ implies $B\in\mathcal{I}(\mathcal{A})$.

Condition for perfect matching in bipartite graphs

A proof: a bipartite graph with 2n vertices whose largest independent set size is n has a perfect matching

find the maximal matching for a graph

Looking for name of combinatorial problem- Permute rows and columns to minimize distance to target matrix

Show that a connected simple graph for which every edge is in some perfect matching is a block

Example for Berge's theorem on matching

Conditions on Bipartite Graphs guaranteeing matchings

How many malicious bingo cards are there?

Computing fixpoints of noncrossing matchings of $2n$ points under rotation.

Maximum number of edges in no 3-matching

Assignment problem with divisible tasks and hours

Trending Questions

Popular # Hahtags

Popular Questions