List questions from matching-theory

Published on 07 Mar 2026 - 10:56

1.5k

Views

Maximal vs. maximum sized matchings

Published on 12 May 2020 - 8:30

45

Views

Determining the most possible number of winners in a raffle

Published on 22 May 2020 - 13:20

276

Views

How to write the dual problem (for stable matching)

Published on 25 May 2020 - 1:52

223

Views

Show that if a Bipartite Graph's minimum degree is equal to n, then the Bipartite Graph's matching consists of at least n edges

Published on 01 Jun 2020 - 17:57

482

Views

Barrier and Maximal Matching of a Graph

Published on 03 Jun 2020 - 12:43

240

Views

Factor-critical Graph and Its Blocks

Published on 04 Jun 2020 - 1:45

282

Views

On the hard direction proof of Hall's theorem for bipartite graphs

Published on 06 Jun 2020 - 7:25

818

Views

matching in k-regular graph

Published on 12 Jun 2020 - 8:00

756

Views

Matching in bipartite graph $|M|\geq \frac {n}{\Delta (G)}$.

Published on 12 Jun 2020 - 9:55

490

Views

Maximum number of edges of a bipartite connected graph with vertex classes of size $n$ and with no perfect matching

Published on 18 Jun 2020 - 22:33

110

Views

Hall's theorem usage

Published on 24 Mar 2026 - 18:14

152

Views

Let $\alpha_{1}$ denote the maximum number of edges in a matching. Prove that $\alpha_{1}=\min\{\delta(G),\lfloor\frac{|G|}{2}\rfloor\}$

Published on 22 Jun 2020 - 23:16

928

Views

Perfect Matching on Bipartite Graph

Published on 24 Jun 2020 - 6:16

138

Views

Different matchings in $K_{10}$, the complete graph with 10 vertices, with 4 edges

Published on 01 Jul 2020 - 10:51

List Question

Dirac's theroem for bipartite graphs

Maximal vs. maximum sized matchings

Determining the most possible number of winners in a raffle

How to write the dual problem (for stable matching)

Show that if a Bipartite Graph's minimum degree is equal to n, then the Bipartite Graph's matching consists of at least n edges

Barrier and Maximal Matching of a Graph

Factor-critical Graph and Its Blocks

On the hard direction proof of Hall's theorem for bipartite graphs

matching in k-regular graph

Matching in bipartite graph $|M|\geq \frac {n}{\Delta (G)}$.

Maximum number of edges of a bipartite connected graph with vertex classes of size $n$ and with no perfect matching

Hall's theorem usage

Let $\alpha_{1}$ denote the maximum number of edges in a matching. Prove that $\alpha_{1}=\min\{\delta(G),\lfloor\frac{|G|}{2}\rfloor\}$

Perfect Matching on Bipartite Graph

Different matchings in $K_{10}$, the complete graph with 10 vertices, with 4 edges

Trending Questions

Popular # Hahtags

Popular Questions