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 256 · Answer 1 · 2026-04-14 23:10:06

256

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 14 Apr 2026 - 23:10

score 4.2k · Answer 2 · 2026-04-17 08:23:32

4.2k

Views

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

Published on 17 Apr 2026 - 8:23

score 176 · Answer 3 · 2026-04-11 17:03:52

176

Views

What does the xor operator do in Stable matching

Published on 11 Apr 2026 - 17:03

score 36 · Answer 4 · 2026-04-14 16:18:39

36

Views

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

Published on 14 Apr 2026 - 16:18

score 268 · Answer 5 · 2026-04-15 16:41:22

268

Views

Condition for perfect matching in bipartite graphs

Published on 15 Apr 2026 - 16:41

score 1.6k · Answer 6 · 2026-04-14 16:45:03

1.6k

Views

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

Published on 14 Apr 2026 - 16:45

score 190 · Answer 7 · 2026-04-15 18:59:14

190

Views

find the maximal matching for a graph

Published on 15 Apr 2026 - 18:59

score 239 · Answer 8 · 2026-04-28 02:24:09

239

Views

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

Published on 28 Apr 2026 - 2:24

score 31 · Answer 9 · 2026-04-16 14:59:38

31

Views

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

Published on 16 Apr 2026 - 14:59

score 617 · Answer 10 · 2026-04-16 15:44:20

617

Views

Example for Berge's theorem on matching

Published on 16 Apr 2026 - 15:44

score 108 · Answer 11 · 2026-04-12 06:19:20

108

Views

Conditions on Bipartite Graphs guaranteeing matchings

Published on 12 Apr 2026 - 6:19

score 1k · Answer 12 · 2026-04-16 08:09:03

1k

Views

How many malicious bingo cards are there?

Published on 16 Apr 2026 - 8:09

score 194 · Answer 13 · 2026-04-16 05:50:13

194

Views

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

Published on 16 Apr 2026 - 5:50

score 378 · Answer 14 · 2026-04-16 13:42:55

378

Views

Maximum number of edges in no 3-matching

Published on 16 Apr 2026 - 13:42

score 152 · Answer 15 · 2026-04-12 16:49:01

152

Views

Assignment problem with divisible tasks and hours

Published on 12 Apr 2026 - 16:49

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