Question

Application of Hall's theorem to find a matching of a specific size

score 1.1k · Answer 1 · 2017-10-30 21:00:12

1.1k

Views

Application of Hall's theorem to find a matching of a specific size

Published on 30 Oct 2017 - 21:00

score 500 · Answer 2 · 2017-11-04 20:55:20

500

Views

Construct a bipartite graph satisfying a condition

Published on 04 Nov 2017 - 20:55

score 661 · Answer 3 · 2017-11-06 00:44:46

661

Views

Prove a lower bound for the maximum matching

Published on 06 Nov 2017 - 0:44

score 873 · Answer 4 · 2017-11-06 04:08:40

873

Views

A connected regular bipartite graph with two vertices removed still has a perfect matching

Published on 06 Nov 2017 - 4:08

score 240 · Answer 5 · 2017-11-11 17:34:10

240

Views

Suppose that $e(G)\ge 1$. Show that the algorithm produces a matching with at least $\frac{e(G)}{2\Delta(G)-1}$ edges.

Published on 11 Nov 2017 - 17:34

score 1k · Answer 6 · 2017-11-12 00:47:05

1k

Views

Maximum matching for bipartite graph

Published on 12 Nov 2017 - 0:47

score 909 · Answer 7 · 2017-11-12 14:36:15

909

Views

Prove that $\beta (G)\le 2\alpha^{'}(G)$ for every graph $G$.

Published on 12 Nov 2017 - 14:36

score 513 · Answer 8 · 2017-11-26 18:57:11

513

Views

Questions about a graph with a single perfect matching

Published on 26 Nov 2017 - 18:57

score 1.2k · Answer 9 · 2017-11-26 20:53:41

1.2k

Views

How to determine the relation between the size of a maximum matching and a maximum independent set in a tree?

Published on 26 Nov 2017 - 20:53

score 756 · Answer 10 · 2017-11-26 21:52:06

756

Views

Lower bound for the size of the maximum matching in a particular bipartite graph

Published on 26 Nov 2017 - 21:52

score 348 · Answer 11 · 2017-11-28 21:12:12

348

Views

Matchings that cover all vertices of maximum degree

Published on 28 Nov 2017 - 21:12

score 245 · Answer 12 · 2017-11-30 09:18:32

245

Views

Factorization of a complete graph on $6$ vertices.

Published on 30 Nov 2017 - 9:18

score 3.4k · Answer 13 · 2017-12-05 04:32:31

3.4k

Views

Perfect matching in the Petersen graph

Published on 05 Dec 2017 - 4:32

score 244 · Answer 14 · 2017-12-05 23:38:02

244

Views

Extension of Hall's Condition for general graphs.

Published on 05 Dec 2017 - 23:38

score 1.9k · Answer 15 · 2017-12-11 20:41:28

1.9k

Views

Show that a bipartite graph G is a union of ∆(G) matchings (maximum degree)

Published on 11 Dec 2017 - 20:41

List Question

Application of Hall's theorem to find a matching of a specific size

Construct a bipartite graph satisfying a condition

Prove a lower bound for the maximum matching

A connected regular bipartite graph with two vertices removed still has a perfect matching

Suppose that $e(G)\ge 1$. Show that the algorithm produces a matching with at least $\frac{e(G)}{2\Delta(G)-1}$ edges.

Maximum matching for bipartite graph

Prove that $\beta (G)\le 2\alpha^{'}(G)$ for every graph $G$.

Questions about a graph with a single perfect matching

How to determine the relation between the size of a maximum matching and a maximum independent set in a tree?

Lower bound for the size of the maximum matching in a particular bipartite graph

Matchings that cover all vertices of maximum degree

Factorization of a complete graph on $6$ vertices.

Perfect matching in the Petersen graph

Extension of Hall's Condition for general graphs.

Show that a bipartite graph G is a union of ∆(G) matchings (maximum degree)

Trending Questions

Popular # Hahtags

Popular Questions