List questions from matching-theory

Published on 22 Mar 2026 - 2:17

81

Views

The matching number in powers of cycles

Published on 25 Feb 2019 - 9:41

154

Views

Stable Matching Theorem

Published on 25 Feb 2019 - 15:49

704

Views

Does Kőnig's theorem hold for infinite bipartite graphs?

Published on 25 Mar 2026 - 1:22

587

Views

Use min-cut max-flow to prove that the matching number $\alpha'(G)$ of a bipartite graph is equal to its vertex cover number $\beta(G)$

Published on 10 Mar 2019 - 21:38

128

Views

Bipartite allocation with minimum cost

Published on 12 Mar 2019 - 13:19

188

Views

Game on a Graph

Published on 23 Mar 2026 - 6:05

114

Views

Question regarding perfect matchings in a graph

Published on 01 Apr 2019 - 9:02

69

Views

Matching students with books, such that each student matches k books and each book matches k students

Published on 05 Apr 2019 - 5:55

101

Views

Assign a list L(x) of size two to every vertex x of an odd cycle. Show that there is an L-coloring unless all sets L(x) are the same.

Published on 08 Apr 2019 - 15:10

198

Views

How to write the optimization constraint of the following problem

Published on 22 Mar 2026 - 1:20

39

Views

Lower bounds on # of hyper-edges in a hyper-graph with many near-perfect matchings

Published on 13 Apr 2019 - 18:44

99

Views

Find the Ramsey number $R(G, P_3)$

Published on 15 Apr 2019 - 22:26

1.2k

Views

Show that the connected components of a graph induced by the symmetric difference of two perfect matchings are a cycle.

Published on 09 May 2019 - 0:50

157

Views

All graphs with maximum degree $\ge\frac{|V(G)|}{2}$ is Class 1

Published on 12 May 2019 - 16:17

List Question

Balanced weight perfect matching

The matching number in powers of cycles

Stable Matching Theorem

Does Kőnig's theorem hold for infinite bipartite graphs?

Use min-cut max-flow to prove that the matching number $\alpha'(G)$ of a bipartite graph is equal to its vertex cover number $\beta(G)$

Bipartite allocation with minimum cost

Game on a Graph

Question regarding perfect matchings in a graph

Matching students with books, such that each student matches k books and each book matches k students

Assign a list L(x) of size two to every vertex x of an odd cycle. Show that there is an L-coloring unless all sets L(x) are the same.

How to write the optimization constraint of the following problem

Lower bounds on # of hyper-edges in a hyper-graph with many near-perfect matchings

Find the Ramsey number $R(G, P_3)$

Show that the connected components of a graph induced by the symmetric difference of two perfect matchings are a cycle.

All graphs with maximum degree $\ge\frac{|V(G)|}{2}$ is Class 1

Trending Questions

Popular # Hahtags

Popular Questions