Question

How to show that popular matching is a special case of prioritized popular matching when priority is given by a random generator.

score 22 · Answer 1 · 2022-06-22 15:55:41

22

Views

How to show that popular matching is a special case of prioritized popular matching when priority is given by a random generator.

Published on 22 Jun 2022 - 15:55

score 68 · Answer 2 · 2022-06-30 09:03:50

68

Views

Matching intepretation of decomposition Dulmage-Mendelsohn

Published on 30 Jun 2022 - 9:03

score 86 · Answer 3 · 2022-07-25 21:11:58

86

Views

$M$ is a matching iff every vertex has degree at most 1

Published on 25 Jul 2022 - 21:11

score 151 · Answer 4 · 2022-08-15 02:37:34

151

Views

Prove A can be written as the sum of such matrices

Published on 15 Aug 2022 - 2:37

score 173 · Answer 5 · 2026-02-24 06:43:09

173

Views

Pairing cartesian coordinates for minimum distance

Published on 24 Feb 2026 - 6:43

score 447 · Answer 6 · 2022-08-25 13:11:39

447

Views

Matching in a bipartite graph with classes $A$ and $B$ and $d(a) \geq 1$ for all $a \in A$. And $d(a) \geq d(b)$ for all $(a,b) \in E(H)$

Published on 25 Aug 2022 - 13:11

score 160 · Answer 7 · 2026-03-27 08:41:22

160

Views

Find the relationship between vertex connectivity and mathcing number.

Published on 27 Mar 2026 - 8:41

score 283 · Answer 8 · 2026-03-27 03:41:37

283

Views

Given an arbitrary vertex connectivity $\kappa$, is there a graph that satisfies $\kappa(G) > \alpha'(G)$？

Published on 27 Mar 2026 - 3:41

score 31 · Answer 9 · 2022-09-07 18:18:48

31

Views

How to group 2-member subsets so that in a group no two subsets have a common elements?

Published on 07 Sep 2022 - 18:18

score 95 · Answer 10 · 2022-09-11 03:48:38

95

Views

Could a complete graph $K_{2n}$ be covered by perfect matchings with no same edge?

Published on 11 Sep 2022 - 3:48

score 63 · Answer 11 · 2022-09-15 09:29:26

63

Views

Finding perfect matchings

Published on 15 Sep 2022 - 9:29

score 83 · Answer 12 · 2022-09-22 05:52:11

83

Views

Couples Problems (Unions of Perfect Matchings)

Published on 22 Sep 2022 - 5:52

score 34 · Answer 13 · 2022-10-14 01:09:59

34

Views

Maximum number of ways to select $2$ element disjoint subsets from an $n$ set

Published on 14 Oct 2022 - 1:09

score 182 · Answer 14 · 2022-10-21 23:03:08

182

Views

Existence of $M$-augmenting path with length smaller than a value

Published on 21 Oct 2022 - 23:03

score 279 · Answer 15 · 2022-10-24 01:48:57

If $G$ is $k$-connected graph, has no perfect matching and is not factor-critical, then $\nu(G) \geq k$ and $\tau(G) \leq 2 \nu(G) -k$

List Question

How to show that popular matching is a special case of prioritized popular matching when priority is given by a random generator.

Matching intepretation of decomposition Dulmage-Mendelsohn

$M$ is a matching iff every vertex has degree at most 1

Prove A can be written as the sum of such matrices

Pairing cartesian coordinates for minimum distance

Matching in a bipartite graph with classes $A$ and $B$ and $d(a) \geq 1$ for all $a \in A$. And $d(a) \geq d(b)$ for all $(a,b) \in E(H)$

Find the relationship between vertex connectivity and mathcing number.

Given an arbitrary vertex connectivity $\kappa$, is there a graph that satisfies $\kappa(G) > \alpha'(G)$？

How to group 2-member subsets so that in a group no two subsets have a common elements?

Could a complete graph $K_{2n}$ be covered by perfect matchings with no same edge?

Finding perfect matchings

Couples Problems (Unions of Perfect Matchings)

Maximum number of ways to select $2$ element disjoint subsets from an $n$ set

Existence of $M$-augmenting path with length smaller than a value

If $G$ is $k$-connected graph, has no perfect matching and is not factor-critical, then $\nu(G) \geq k$ and $\tau(G) \leq 2 \nu(G) -k$

Trending Questions

Popular # Hahtags

Popular Questions