List questions from bipartite-graphs

Published on 28 Mar 2026 - 2:10

1k

Views

How to represent tripartite graphs as matrices?

Published on 25 Mar 2026 - 19:08

2.4k

Views

$\{0,1\}$-matrix and permutation matrices

Published on 26 Mar 2026 - 1:20

692

Views

Every almost $r$-regular graph has a spanning almost $(r-1)$-regular subgraph

Published on 17 May 2016 - 1:21

375

Views

Is there a much easier way to find the vertices of a Eulerian Path?

Published on 17 May 2016 - 21:38

574

Views

Let $G$ be a $k$-regular bipartite graph, $k \ge 2$. Prove that every edge of $G$ appears in some perfect matcing in $G$. Is this proof correct?

Published on 19 May 2016 - 17:11

69

Views

The maximum number of matching iterations

Published on 25 May 2016 - 2:21

73

Views

Prove that a simple graph $G$ on $n$ vertices that contains no $K_{2,3}$ has at most $n^{3/2}$ edges.

Published on 26 May 2016 - 9:54

3.8k

Views

Derive Hall's theorem from Tutte's theorem

Published on 26 Mar 2026 - 16:07

32.2k

Views

Prove that a $k$-regular bipartite graph has a perfect matching

Published on 26 Mar 2026 - 14:24

94

Views

Algorithm to order and partition a set of of (n,m) pairs with constraints.

Published on 29 Mar 2026 - 19:17

217

Views

Graph Connectedness Proof

Published on 26 Mar 2026 - 6:23

178

Views

Prove that a bipartite graph $G$ always has a matching $M$, such that $|M| \gt \frac{|E(G)|}{∆(G)}$.

Published on 05 Jun 2016 - 16:13

908

Views

Prove that there is always a perfect match

Published on 11 Jun 2016 - 0:00

120

Views

Eulerian Cycle in a Random Bipartite Graph

Published on 26 Mar 2026 - 13:30

List Question

Number of non-isomorphic embeddings.

How to represent tripartite graphs as matrices?

$\{0,1\}$-matrix and permutation matrices

Every almost $r$-regular graph has a spanning almost $(r-1)$-regular subgraph

Is there a much easier way to find the vertices of a Eulerian Path?

Let $G$ be a $k$-regular bipartite graph, $k \ge 2$. Prove that every edge of $G$ appears in some perfect matcing in $G$. Is this proof correct?

The maximum number of matching iterations

Prove that a simple graph $G$ on $n$ vertices that contains no $K_{2,3}$ has at most $n^{3/2}$ edges.

Derive Hall's theorem from Tutte's theorem

Prove that a $k$-regular bipartite graph has a perfect matching

Algorithm to order and partition a set of of (n,m) pairs with constraints.

Graph Connectedness Proof

Prove that a bipartite graph $G$ always has a matching $M$, such that $|M| \gt \frac{|E(G)|}{∆(G)}$.

Prove that there is always a perfect match

Eulerian Cycle in a Random Bipartite Graph

Trending Questions

Popular # Hahtags

Popular Questions