Question

Assignment Problem (Hungarian): Does increasing a match-specific payoff always make it more likely to be selected?

score 53 · Answer 1 · 2022-06-13 01:25:31

53

Views

Assignment Problem (Hungarian): Does increasing a match-specific payoff always make it more likely to be selected?

Published on 13 Jun 2022 - 1:25

score 196 · Answer 2 · 2026-03-30 03:53:47

196

Views

How many connected bipartite graphs are there?

Published on 30 Mar 2026 - 3:53

score 23 · Answer 3 · 2026-03-28 01:35:12

23

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 28 Mar 2026 - 1:35

score 314 · Answer 4 · 2022-06-25 18:28:27

314

Views

Given a complete bipartite graph of $K_{m,n}$, assume $n \geq m \geq 1$. Prove that every cycle contained in the $K_{m,n}$ has at most $2m$ vertices.

Published on 25 Jun 2022 - 18:28

score 69 · Answer 5 · 2026-03-28 01:35:22

69

Views

Matching intepretation of decomposition Dulmage-Mendelsohn

Published on 28 Mar 2026 - 1:35

score 150 · Answer 6 · 2022-07-14 22:49:19

150

Views

Degeneracy of complete bipartite graphs

Published on 14 Jul 2022 - 22:49

score 113 · Answer 7 · 2026-03-27 03:43:09

113

Views

Is it possible to disconnect a bipartite vertex and edge transitive multigraph by removing $k$ edges without isolating a vertex?

Published on 27 Mar 2026 - 3:43

score 84 · Answer 8 · 2026-03-27 21:17:43

84

Views

Bounds on $k$-medians

Published on 27 Mar 2026 - 21:17

score 314 · Answer 9 · 2026-03-27 20:22:30

314

Views

If $G$ is a triangle-free and $\delta(G)$ is large, then $G$ is bipartite graph

Published on 27 Mar 2026 - 20:22

score 79 · Answer 10 · 2022-08-10 08:20:40

79

Views

Vertices connection of Assignment Problem in Bipartite Graph

Published on 10 Aug 2022 - 8:20

score 276 · Answer 11 · 2022-08-14 01:06:26

276

Views

Finding the longest cycle in a bipartite graph?

Published on 14 Aug 2022 - 1:06

score 152 · Answer 12 · 2026-03-28 01:35:23

152

Views

Prove A can be written as the sum of such matrices

Published on 28 Mar 2026 - 1:35

score 448 · Answer 13 · 2026-03-28 01:26:22

448

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 28 Mar 2026 - 1:26

score 75 · Answer 14 · 2022-08-31 15:58:02

75

Views

Decompose large bipartite graph into small bipartite graphs?

Published on 31 Aug 2022 - 15:58

score 65 · Answer 15 · 2022-09-05 12:34:14

65

Views

Connected Bipartite Vertex-transitive Graph Recognition

Published on 05 Sep 2022 - 12:34

List Question

Assignment Problem (Hungarian): Does increasing a match-specific payoff always make it more likely to be selected?

How many connected bipartite graphs are there?

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

Given a complete bipartite graph of $K_{m,n}$, assume $n \geq m \geq 1$. Prove that every cycle contained in the $K_{m,n}$ has at most $2m$ vertices.

Matching intepretation of decomposition Dulmage-Mendelsohn

Degeneracy of complete bipartite graphs

Is it possible to disconnect a bipartite vertex and edge transitive multigraph by removing $k$ edges without isolating a vertex?

Bounds on $k$-medians

If $G$ is a triangle-free and $\delta(G)$ is large, then $G$ is bipartite graph

Vertices connection of Assignment Problem in Bipartite Graph

Finding the longest cycle in a bipartite graph?

Prove A can be written as the sum of such matrices

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)$

Decompose large bipartite graph into small bipartite graphs?

Connected Bipartite Vertex-transitive Graph Recognition

Trending Questions

Popular # Hahtags

Popular Questions