Question

How to show this bipartite graph has a matching saturating X?

score 245 · Answer 1 · 2021-06-02 18:57:30

245

Views

How to show this bipartite graph has a matching saturating X?

Published on 02 Jun 2021 - 18:57

score 83 · Answer 2 · 2021-06-03 23:12:52

83

Views

Proving Hall's Theorem, struggling proving closedness in product topology on the way.

Published on 03 Jun 2021 - 23:12

score 42 · Answer 3 · 2021-06-08 15:15:11

42

Views

Existence of perfect matching after swapping colors

Published on 08 Jun 2021 - 15:15

score 489 · Answer 4 · 2021-06-09 22:40:34

489

Views

Does a bipartite graph without perfect matching exist?

Published on 09 Jun 2021 - 22:40

score 74 · Answer 5 · 2021-06-14 07:31:56

74

Views

The bipartite graph admits a perfect match

Published on 14 Jun 2021 - 7:31

score 128 · Answer 6 · 2021-06-14 21:34:19

128

Views

About Hall's Theorem

Published on 14 Jun 2021 - 21:34

score 131 · Answer 7 · 2021-06-25 05:36:27

131

Views

Coloring an $m \times n$ rectangular board with $2-$ colors

Published on 25 Jun 2021 - 5:36

score 343 · Answer 8 · 2021-06-25 13:02:27

343

Views

If a graph has a perfect matching, does that mean that there exists a vertex set $S$ such that $|S|$ is equal to $o(G-S)$?

Published on 25 Jun 2021 - 13:02

score 35 · Answer 9 · 2021-06-28 21:30:45

35

Views

Sufficient Condition is $|A-N(T)|\leq |B-T|$ For Every $T \subset B$.

Published on 28 Jun 2021 - 21:30

score 85 · Answer 10 · 2021-07-04 10:43:30

85

Views

Maximise the number of nodes with degree zero in a bipartite graph

Published on 04 Jul 2021 - 10:43

score 302 · Answer 11 · 2021-07-07 17:52:45

302

Views

Is there any formula for counting the number of 1-factorizations of a complete graph?

Published on 07 Jul 2021 - 17:52

score 182 · Answer 12 · 2021-07-11 18:07:37

182

Views

Union of matchings is not necessarily bipartite?

Published on 11 Jul 2021 - 18:07

score 72 · Answer 13 · 2021-07-12 16:30:46

72

Views

1-factorization: Possible that a graph G has a 1-factorization, but there is a 1-factor F so that G-F has no 1-factorization

Published on 12 Jul 2021 - 16:30

score 192 · Answer 14 · 2021-07-15 09:31:17

192

Views

Perfect matching preserving connectedness in regular bipartite graph

Published on 15 Jul 2021 - 9:31

score 544 · Answer 15 · 2026-03-26 20:39:57

544

Views

Prove the pseudo k-regular bipartite graphs has a perfect matching

Published on 26 Mar 2026 - 20:39

List Question

How to show this bipartite graph has a matching saturating X?

Proving Hall's Theorem, struggling proving closedness in product topology on the way.

Existence of perfect matching after swapping colors

Does a bipartite graph without perfect matching exist?

The bipartite graph admits a perfect match

About Hall's Theorem

Coloring an $m \times n$ rectangular board with $2-$ colors

If a graph has a perfect matching, does that mean that there exists a vertex set $S$ such that $|S|$ is equal to $o(G-S)$?

Sufficient Condition is $|A-N(T)|\leq |B-T|$ For Every $T \subset B$.

Maximise the number of nodes with degree zero in a bipartite graph

Is there any formula for counting the number of 1-factorizations of a complete graph?

Union of matchings is not necessarily bipartite?

1-factorization: Possible that a graph G has a 1-factorization, but there is a 1-factor F so that G-F has no 1-factorization

Perfect matching preserving connectedness in regular bipartite graph

Prove the pseudo k-regular bipartite graphs has a perfect matching

Trending Questions

Popular # Hahtags

Popular Questions