List questions from bipartite-graphs

Published on 11 Mar 2026 - 18:16

1.5k

Views

Number of possible bipartite graphs

Published on 16 Jul 2018 - 6:48

1.6k

Views

A proof: a bipartite graph with 2n vertices whose largest independent set size is n has a perfect matching

Published on 18 Jul 2018 - 21:20

1k

Views

K-regular bipartite

Published on 01 Aug 2018 - 10:39

188

Views

find the maximal matching for a graph

Published on 25 Mar 2026 - 4:37

186

Views

2-factor in a bipartite graph (N)

Published on 09 Aug 2018 - 7:11

106

Views

Conditions on Bipartite Graphs guaranteeing matchings

Published on 25 Mar 2026 - 3:01

77

Views

Graph $G$ that does not contain a loop contains a bipartite spanning subgraph $H$, such that for any vertex $v$, there is $d_H(v)\ge\frac{1}{2}d_G(v)$

Published on 13 Sep 2018 - 16:02

150

Views

Assignment problem with divisible tasks and hours

Published on 25 Mar 2026 - 2:57

362

Views

bipartite graph has a matching such that all vertices on one side are matched.

Published on 17 Sep 2018 - 17:16

1.1k

Views

3-connected planar bipartite graph without a Hamiltonian path

Published on 25 Mar 2026 - 5:00

553

Views

Bipartite graph with n vertices

Published on 22 Sep 2018 - 2:21

466

Views

Maximum connected components after removing 2 vertices

Published on 25 Mar 2026 - 4:54

440

Views

Matching problem of slightly different chessboard

Published on 25 Mar 2026 - 1:22

244

Views

Is this theorem about girth and bipartite graph wrong?

Published on 06 Oct 2018 - 18:46

List Question

Size of min-cut in a Rényi–Erdős graph

Number of possible bipartite graphs

A proof: a bipartite graph with 2n vertices whose largest independent set size is n has a perfect matching

K-regular bipartite

find the maximal matching for a graph

2-factor in a bipartite graph (N)

Conditions on Bipartite Graphs guaranteeing matchings

Graph $G$ that does not contain a loop contains a bipartite spanning subgraph $H$, such that for any vertex $v$, there is $d_H(v)\ge\frac{1}{2}d_G(v)$

Assignment problem with divisible tasks and hours

bipartite graph has a matching such that all vertices on one side are matched.

3-connected planar bipartite graph without a Hamiltonian path

Bipartite graph with n vertices

Maximum connected components after removing 2 vertices

Matching problem of slightly different chessboard

Is this theorem about girth and bipartite graph wrong?

Trending Questions

Popular # Hahtags

Popular Questions