Question

Hall's marriage theorem: sufficiency proof by contraposition

score 120 · Answer 1 · 2021-12-29 11:59:07

120

Views

Hall's marriage theorem: sufficiency proof by contraposition

Published on 29 Dec 2021 - 11:59

score 223 · Answer 2 · 2021-12-30 04:27:13

223

Views

vertex covering number

Published on 30 Dec 2021 - 4:27

score 134 · Answer 3 · 2021-12-30 14:14:31

134

Views

Deficient version of Halls Theorem to Show a Bipartite Graph has a matching

Published on 30 Dec 2021 - 14:14

score 66 · Answer 4 · 2022-01-02 17:30:15

66

Views

Number of distinct perfect matching in a d-regular graph.

Published on 02 Jan 2022 - 17:30

score 71 · Answer 5 · 2022-01-03 11:33:05

71

Views

finding disjoint subsets of a family of k-sets

Published on 03 Jan 2022 - 11:33

score 249 · Answer 6 · 2022-01-05 18:30:51

249

Views

Undirected connected claw-free graph with even number of vertices implies existing perfect matching

Published on 05 Jan 2022 - 18:30

score 660 · Answer 7 · 2022-01-07 15:37:30

660

Views

An optimal non-bipartite matching (Python implementation)

Published on 07 Jan 2022 - 15:37

score 706 · Answer 8 · 2022-01-08 11:17:24

706

Views

A 3-regular graph with at most 2 bridges has 1 factor.

Published on 08 Jan 2022 - 11:17

score 412 · Answer 9 · 2022-01-09 02:19:49

412

Views

Can every d-regular graph be decomposed into at most d+1 matchings?

Published on 09 Jan 2022 - 2:19

score 230 · Answer 10 · 2022-01-12 15:15:23

230

Views

A corollary from Sperner's Theorem

Published on 12 Jan 2022 - 15:15

score 178 · Answer 11 · 2022-01-12 16:21:59

178

Views

Complexity of finding a matching with color constraints in an edge-colored graph with only 2 colors.

Published on 12 Jan 2022 - 16:21

score 113 · Answer 12 · 2022-01-20 11:19:32

113

Views

Simple graph with vertex degree $\geq k$ has a matching of cardinality $\min\{k,\lfloor \frac{|V|}{2}\rfloor\}$

Published on 20 Jan 2022 - 11:19

score 456 · Answer 13 · 2022-01-20 11:23:34

456

Views

If G is n regular, then G has n disjoint perfect matchings.

Published on 20 Jan 2022 - 11:23

score 69 · Answer 14 · 2022-02-09 00:56:56

69

Views

explicit bijection between ${[2n+1]\choose n+1}$ and ${[2n+1]\choose n}$ mapping $A$ to a subset of $A$

Published on 09 Feb 2022 - 0:56

score 34 · Answer 15 · 2022-02-11 00:56:24

34

Views

A combinatorics problem about perfect pairings

Published on 11 Feb 2022 - 0:56

List Question

Hall's marriage theorem: sufficiency proof by contraposition

vertex covering number

Deficient version of Halls Theorem to Show a Bipartite Graph has a matching

Number of distinct perfect matching in a d-regular graph.

finding disjoint subsets of a family of k-sets

Undirected connected claw-free graph with even number of vertices implies existing perfect matching

An optimal non-bipartite matching (Python implementation)

A 3-regular graph with at most 2 bridges has 1 factor.

Can every d-regular graph be decomposed into at most d+1 matchings?

A corollary from Sperner's Theorem

Complexity of finding a matching with color constraints in an edge-colored graph with only 2 colors.

Simple graph with vertex degree $\geq k$ has a matching of cardinality $\min\{k,\lfloor \frac{|V|}{2}\rfloor\}$

If G is n regular, then G has n disjoint perfect matchings.

explicit bijection between ${[2n+1]\choose n+1}$ and ${[2n+1]\choose n}$ mapping $A$ to a subset of $A$

A combinatorics problem about perfect pairings

Trending Questions

Popular # Hahtags

Popular Questions