Question

Is p-dimensional matching with $(p-1)n$ edges NP-hard? What about $3n$ edges?

score 133 · Answer 1 · 2026-02-23 15:09:22

133

Views

Is p-dimensional matching with $(p-1)n$ edges NP-hard? What about $3n$ edges?

Published on 23 Feb 2026 - 15:09

score 235 · Answer 2 · 2021-07-29 19:45:03

235

Views

Prove that in a 5-regular and 4-edge connected graph, every edge is in a perfect matching

Published on 29 Jul 2021 - 19:45

score 467 · Answer 3 · 2021-07-29 20:06:25

467

Views

Prove that if $G$ has a perfect matching and no Tutte set contains $x,y$, then there is a perfect matching contains $x,y$

Published on 29 Jul 2021 - 20:06

score 375 · Answer 4 · 2021-08-05 21:04:09

375

Views

Bipartite graph with exactly one perfect matching.

Published on 05 Aug 2021 - 21:04

score 42 · Answer 5 · 2021-08-07 22:23:22

42

Views

Smallest sum of differences between the numbers in two datasets

Published on 07 Aug 2021 - 22:23

score 251 · Answer 6 · 2021-08-11 15:32:34

251

Views

Partition the edges of a bipartite graph into perfect $b$-matchings

Published on 11 Aug 2021 - 15:32

score 68 · Answer 7 · 2026-02-24 00:14:02

68

Views

Closed form expression‎ of double-way matching problem (Special case of derangement)

Published on 24 Feb 2026 - 0:14

score 62 · Answer 8 · 2021-08-13 20:40:20

62

Views

$G - u - v$ is not matchable if and only if $G$ has a barrier $B$ such that $u, v \in B$.

Published on 13 Aug 2021 - 20:40

score 434 · Answer 9 · 2021-09-01 08:52:27

434

Views

Maximum independent set in a graph versus maximum matching in the line graph

Published on 01 Sep 2021 - 8:52

score 96 · Answer 10 · 2021-09-02 23:13:10

96

Views

How many perfect matches are there in a graph with $n$ connected components?

Published on 02 Sep 2021 - 23:13

score 190 · Answer 11 · 2021-09-10 02:27:38

190

Views

Maximum multi-matching

Published on 10 Sep 2021 - 2:27

score 369 · Answer 12 · 2021-09-18 11:41:42

369

Views

A cubic graph with an bridge and the perfect matching

Published on 18 Sep 2021 - 11:41

score 109 · Answer 13 · 2021-09-18 19:03:06

109

Views

a curiosity about cards, why this is true?

Published on 18 Sep 2021 - 19:03

score 109 · Answer 14 · 2021-10-03 15:55:51

109

Views

Clarification on Diestel's proof of Tutte's Theorem.

Published on 03 Oct 2021 - 15:55

score 103 · Answer 15 · 2021-10-07 13:49:14

103

Views

Combinatorics, Hall's marriage theorem for bipartite graphs, where 2 vertices cannot be connected to more than one common vertex from the other side

Published on 07 Oct 2021 - 13:49

List Question

Is p-dimensional matching with $(p-1)n$ edges NP-hard? What about $3n$ edges?

Prove that in a 5-regular and 4-edge connected graph, every edge is in a perfect matching

Prove that if $G$ has a perfect matching and no Tutte set contains $x,y$, then there is a perfect matching contains $x,y$

Bipartite graph with exactly one perfect matching.

Smallest sum of differences between the numbers in two datasets

Partition the edges of a bipartite graph into perfect $b$-matchings

Closed form expression‎ of double-way matching problem (Special case of derangement)

$G - u - v$ is not matchable if and only if $G$ has a barrier $B$ such that $u, v \in B$.

Maximum independent set in a graph versus maximum matching in the line graph

How many perfect matches are there in a graph with $n$ connected components?

Maximum multi-matching

A cubic graph with an bridge and the perfect matching

a curiosity about cards, why this is true?

Clarification on Diestel's proof of Tutte's Theorem.

Combinatorics, Hall's marriage theorem for bipartite graphs, where 2 vertices cannot be connected to more than one common vertex from the other side

Trending Questions

Popular # Hahtags

Popular Questions