Question

Perfect matching in a random bipartite graph with edge probability 1/2

score 521 · Answer 1 · 2020-03-25 04:39:34

521

Views

Perfect matching in a random bipartite graph with edge probability 1/2

Published on 25 Mar 2020 - 4:39

score 65 · Answer 2 · 2026-02-23 06:38:38

65

Views

How to calculate number of perfect matchings?

Published on 23 Feb 2026 - 6:38

score 3.1k · Answer 3 · 2020-04-06 03:26:19

3.1k

Views

Prove that at most one man obtains his worst choice in stable matching algorithm

Published on 06 Apr 2020 - 3:26

score 63 · Answer 4 · 2020-04-07 04:58:48

63

Views

Maximum matching in a hamilton graph of "k" vertices is always (k+1)/2 , is this claim correct?

Published on 07 Apr 2020 - 4:58

score 214 · Answer 5 · 2020-04-08 13:38:17

214

Views

Hall's Marriage Theorem question

Published on 08 Apr 2020 - 13:38

score 110 · Answer 6 · 2020-04-15 05:17:57

110

Views

Reducing the Degrees of a Graph where All Degrees are Quite Concentrated

Published on 15 Apr 2020 - 5:17

score 90 · Answer 7 · 2026-03-24 16:10:38

90

Views

Blossom Algorithm

Published on 24 Mar 2026 - 16:10

score 221 · Answer 8 · 2020-04-21 23:48:22

221

Views

Matching of Vertices with Maximal Degree in Bipartite Graph

Published on 21 Apr 2020 - 23:48

score 51 · Answer 9 · 2020-04-22 17:06:56

51

Views

Set theory question that suppose to relate to graph theory.

Published on 22 Apr 2020 - 17:06

score 310 · Answer 10 · 2020-04-25 23:54:20

310

Views

One to many matching, using Hall's theorem?

Published on 25 Apr 2020 - 23:54

score 98 · Answer 11 · 2026-03-24 10:18:57

98

Views

Hall bigamy problem.

Published on 24 Mar 2026 - 10:18

score 61 · Answer 12 · 2020-05-06 06:12:11

61

Views

Partitioning vertices in biregular graph

Published on 06 May 2020 - 6:12

score 245 · Answer 13 · 2020-05-08 02:32:36

245

Views

Let $ G $ be a connected graph and $ C $ be an odd-length cycle in G. Show that if $ H $ has a perfect matching, then $ G $ has a perfect matching .

Published on 08 May 2020 - 2:32

score 275 · Answer 14 · 2020-05-10 13:14:19

275

Views

Maximal Matching in Bipartite Graph with Degrees Given

Published on 10 May 2020 - 13:14

score 73 · Answer 15 · 2020-05-11 11:46:59

73

Views

Minimum vertex degree of a graph divided by 2 is smaller than maximum matching

Published on 11 May 2020 - 11:46

List Question

Perfect matching in a random bipartite graph with edge probability 1/2

How to calculate number of perfect matchings?

Prove that at most one man obtains his worst choice in stable matching algorithm

Maximum matching in a hamilton graph of "k" vertices is always (k+1)/2 , is this claim correct?

Hall's Marriage Theorem question

Reducing the Degrees of a Graph where All Degrees are Quite Concentrated

Blossom Algorithm

Matching of Vertices with Maximal Degree in Bipartite Graph

Set theory question that suppose to relate to graph theory.

One to many matching, using Hall's theorem?

Hall bigamy problem.

Partitioning vertices in biregular graph

Let $ G $ be a connected graph and $ C $ be an odd-length cycle in G. Show that if $ H $ has a perfect matching, then $ G $ has a perfect matching .

Maximal Matching in Bipartite Graph with Degrees Given

Minimum vertex degree of a graph divided by 2 is smaller than maximum matching

Trending Questions

Popular # Hahtags

Popular Questions