List questions from bipartite-graphs

Published on 11 Mar 2026 - 18:16

1.5k

Views

Number of possible bipartite graphs

Published on 16 Apr 2026 - 14:07

1.6k

Views

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

Published on 10 May 2026 - 15:09

1k

Views

K-regular bipartite

Published on 14 Apr 2026 - 21:56

191

Views

find the maximal matching for a graph

Published on 10 May 2026 - 15:08

190

Views

2-factor in a bipartite graph (N)

Published on 14 Apr 2026 - 8:36

109

Views

Conditions on Bipartite Graphs guaranteeing matchings

Published on 10 May 2026 - 15:09

79

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 14 Apr 2026 - 23:01

153

Views

Assignment problem with divisible tasks and hours

Published on 10 May 2026 - 15:07

365

Views

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

Published on 16 Apr 2026 - 3:36

1.1k

Views

3-connected planar bipartite graph without a Hamiltonian path

Published on 13 Apr 2026 - 21:10

557

Views

Bipartite graph with n vertices

Published on 14 Apr 2026 - 8:56

468

Views

Maximum connected components after removing 2 vertices

Published on 12 Apr 2026 - 2:16

443

Views

Matching problem of slightly different chessboard

Published on 10 May 2026 - 16:00

247

Views

Is this theorem about girth and bipartite graph wrong?

Published on 13 Apr 2026 - 10: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