Question

Minimum size of bipartite graph for existence of perfect matching

score 802 · Answer 1 · 2026-03-26 17:32:37

802

Views

Minimum size of bipartite graph for existence of perfect matching

Published on 26 Mar 2026 - 17:32

score 97 · Answer 2 · 2017-06-27 14:34:04

97

Views

There is a cycle in G that contains all vertices of $P$ except (at most) one

Published on 27 Jun 2017 - 14:34

score 281 · Answer 3 · 2017-06-28 22:09:51

281

Views

If $G$ has $2n+1$ vertices and $e$ edges, then it contains a bipartite subgraph with at least $e(n+1)/2n+1$ edges.

Published on 28 Jun 2017 - 22:09

score 4.4k · Answer 4 · 2026-03-26 16:03:40

4.4k

Views

Complete Matching and Maximum Matching

Published on 26 Mar 2026 - 16:03

score 42 · Answer 5 · 2017-07-17 09:40:56

42

Views

Submodularity of function defined on graph

Published on 17 Jul 2017 - 9:40

score 1.4k · Answer 6 · 2026-03-26 19:14:18

1.4k

Views

Algorithm for maximum weight matching

Published on 26 Mar 2026 - 19:14

score 841 · Answer 7 · 2017-08-01 02:58:04

841

Views

Bipartite graphs and induction

Published on 01 Aug 2017 - 2:58

score 67 · Answer 8 · 2017-08-07 09:39:47

67

Views

Conditional probabilities in a bipartite network

Published on 07 Aug 2017 - 9:39

score 67 · Answer 9 · 2026-03-26 09:16:25

67

Views

A cleaning task for a group of busy roommates

Published on 26 Mar 2026 - 9:16

score 1.4k · Answer 10 · 2026-03-27 01:00:10

1.4k

Views

If $G$ is simple with $n$ vertices, doesn't have a triangle and the minimum degree is greater than $\frac{2n}{5}$, then $G$ is bipartite.

Published on 27 Mar 2026 - 1:00

score 1.5k · Answer 11 · 2017-08-14 00:59:19

1.5k

Views

If graph G is bipartite with largest vertex degree $\Delta$(G) , then $\chi'(G)$ = $\Delta$(G)

Published on 14 Aug 2017 - 0:59

score 134 · Answer 12 · 2026-03-26 17:46:40

134

Views

Bipartite graph which number of complete matching is $1$, has at least one $degree=1$ vertex?

Published on 26 Mar 2026 - 17:46

score 480 · Answer 13 · 2026-03-26 17:46:00

480

Views

Application of Hall's marriage theorem

Published on 26 Mar 2026 - 17:46

score 391 · Answer 14 · 2017-08-21 14:49:41

391

Views

Existence of biregular bipartite graph with constraints

Published on 21 Aug 2017 - 14:49

score 635 · Answer 15 · 2026-03-27 16:46:30

635

Views

Graph spectrum: bipartite structure and cluster structure

Published on 27 Mar 2026 - 16:46

List Question

Minimum size of bipartite graph for existence of perfect matching

There is a cycle in G that contains all vertices of $P$ except (at most) one

If $G$ has $2n+1$ vertices and $e$ edges, then it contains a bipartite subgraph with at least $e(n+1)/2n+1$ edges.

Complete Matching and Maximum Matching

Submodularity of function defined on graph

Algorithm for maximum weight matching

Bipartite graphs and induction

Conditional probabilities in a bipartite network

A cleaning task for a group of busy roommates

If $G$ is simple with $n$ vertices, doesn't have a triangle and the minimum degree is greater than $\frac{2n}{5}$, then $G$ is bipartite.

If graph G is bipartite with largest vertex degree $\Delta$(G) , then $\chi'(G)$ = $\Delta$(G)

Bipartite graph which number of complete matching is $1$, has at least one $degree=1$ vertex?

Application of Hall's marriage theorem

Existence of biregular bipartite graph with constraints

Graph spectrum: bipartite structure and cluster structure

Trending Questions

Popular # Hahtags

Popular Questions