Question

Prove that every bipartite graph G has a matching of size ≥ |E(G)|/∆, where ∆ is the maximum degree of G.

score 56 · Answer 1 · 2026-03-26 04:36:28

56

Views

Prove that every bipartite graph G has a matching of size ≥ |E(G)|/∆, where ∆ is the maximum degree of G.

Published on 26 Mar 2026 - 4:36

score 189 · Answer 2 · 2026-03-26 22:17:41

189

Views

Non-isomorphic bipartite Graphs with same degree sequence and cycles

Published on 26 Mar 2026 - 22:17

score 63 · Answer 3 · 2023-05-11 07:25:40

63

Views

Non-complete bipartite graph notation

Published on 11 May 2023 - 7:25

score 84 · Answer 4 · 2026-03-25 16:02:38

84

Views

Maximal spectral norm of balanced $\pm 1$ matrix

Published on 25 Mar 2026 - 16:02

score 115 · Answer 5 · 2023-06-23 10:48:49

115

Views

A question about connected regular bipartite graph

Published on 23 Jun 2023 - 10:48

score 42 · Answer 6 · 2023-06-24 21:50:36

42

Views

Minimal slices for dividing $m$ pizzas to $n$ people is $m+n-\gcd(m,n)$

Published on 24 Jun 2023 - 21:50

score 47 · Answer 7 · 2026-03-26 06:03:18

47

Views

Bipartite Matching Proof

Published on 26 Mar 2026 - 6:03

score 149 · Answer 8 · 2023-07-06 15:32:40

149

Views

No eigenvalue of a graph is larger than the maximum degree

Published on 06 Jul 2023 - 15:32

score 196 · Answer 9 · 2023-07-31 02:55:17

196

Views

Prove that all graphs with Degree Sequence $(2,2,2,2,2,2,2)$ have an odd cycle.

Published on 31 Jul 2023 - 2:55

score 40 · Answer 10 · 2023-08-07 18:25:34

40

Views

How can we use a cartesian product in the definition for bipartite graph when its elements are tuples and edges can be sets?

Published on 07 Aug 2023 - 18:25

score 64 · Answer 11 · 2023-08-16 15:51:59

64

Views

Variant of vertex cover in bipartite graphs

Published on 16 Aug 2023 - 15:51

score 120 · Answer 12 · 2023-08-18 17:34:54

120

Views

Bondy, Murty Graph Theory exercise 16.2.12 (by Noga Alon)

Published on 18 Aug 2023 - 17:34

score 35 · Answer 13 · 2026-03-25 11:14:50

35

Views

Hamiltonicity of bipartite graphs maximum degree $3$, where $X$ or $Y$ is a clique

Published on 25 Mar 2026 - 11:14

score 60 · Answer 14 · 2026-03-26 07:43:31

60

Views

Finding the set that violates Hall’s condition in a bipartite graph.

Published on 26 Mar 2026 - 7:43

score 64 · Answer 15 · 2023-09-21 02:08:30

64

Views

Prove bipartite graph with maximum degree d is a subgraph of a d regular bipartite graph

Published on 21 Sep 2023 - 2:08

List Question

Prove that every bipartite graph G has a matching of size ≥ |E(G)|/∆, where ∆ is the maximum degree of G.

Non-isomorphic bipartite Graphs with same degree sequence and cycles

Non-complete bipartite graph notation

Maximal spectral norm of balanced $\pm 1$ matrix

A question about connected regular bipartite graph

Minimal slices for dividing $m$ pizzas to $n$ people is $m+n-\gcd(m,n)$

Bipartite Matching Proof

No eigenvalue of a graph is larger than the maximum degree

Prove that all graphs with Degree Sequence $(2,2,2,2,2,2,2)$ have an odd cycle.

How can we use a cartesian product in the definition for bipartite graph when its elements are tuples and edges can be sets?

Variant of vertex cover in bipartite graphs

Bondy, Murty Graph Theory exercise 16.2.12 (by Noga Alon)

Hamiltonicity of bipartite graphs maximum degree $3$, where $X$ or $Y$ is a clique

Finding the set that violates Hall’s condition in a bipartite graph.

Prove bipartite graph with maximum degree d is a subgraph of a d regular bipartite graph

Trending Questions

Popular # Hahtags

Popular Questions