Question

Partitioning crown graphs into girth 6 diameter 3 subgraphs / packing of graphs representing finite projective planes

score 79 · Answer 1 · 2026-03-25 12:34:49

79

Views

Partitioning crown graphs into girth 6 diameter 3 subgraphs / packing of graphs representing finite projective planes

Published on 25 Mar 2026 - 12:34

score 757 · Answer 2 · 2026-03-25 19:05:37

757

Views

Matching in bipartite graph $|M|\geq \frac {n}{\Delta (G)}$.

Published on 25 Mar 2026 - 19:05

score 173 · Answer 3 · 2026-03-25 14:25:27

173

Views

In a bipartite graph the absolute value of any eigenvalue is less than the square root of number of edges.

Published on 25 Mar 2026 - 14:25

score 491 · Answer 4 · 2026-03-25 19:07:20

491

Views

Maximum number of edges of a bipartite connected graph with vertex classes of size $n$ and with no perfect matching

Published on 25 Mar 2026 - 19:07

score 167 · Answer 5 · 2026-03-25 07:43:22

167

Views

Which generalization of bipartite graphs is stronger?

Published on 25 Mar 2026 - 7:43

score 61 · Answer 6 · 2020-06-21 01:19:05

61

Views

Is there something incorrect in this question?

Published on 21 Jun 2020 - 1:19

score 929 · Answer 7 · 2026-03-25 22:09:33

929

Views

Perfect Matching on Bipartite Graph

Published on 25 Mar 2026 - 22:09

score 1.1k · Answer 8 · 2020-06-24 19:39:52

1.1k

Views

Under what condition is a complete bipartite graph $K_{m,n}$ a regular graph

Published on 24 Jun 2020 - 19:39

score 165 · Answer 9 · 2026-03-26 11:03:45

165

Views

Graph theory: Questions about Hamiltonian cycles.

Published on 26 Mar 2026 - 11:03

score 242 · Answer 10 · 2026-03-26 16:03:40

242

Views

Isomorphic graphs derived from $K_{10,10}$

Published on 26 Mar 2026 - 16:03

score 41 · Answer 11 · 2020-07-04 22:52:48

41

Views

connected bipartite graph exists

Published on 04 Jul 2020 - 22:52

score 33 · Answer 12 · 2026-03-25 22:09:53

33

Views

Matchings in bipartite graph

Published on 25 Mar 2026 - 22:09

score 928 · Answer 13 · 2026-03-25 20:42:06

928

Views

Given a perfect fractional matching, does there exist a perfect matching with heavy edges?

Published on 25 Mar 2026 - 20:42

score 316 · Answer 14 · 2020-07-14 07:34:17

316

Views

A bipartite graph $K_{m,n}$ can be embedded into a surface $S$, if $\chi (S) \leq m+n - mn/2$.

Published on 14 Jul 2020 - 7:34

score 192 · Answer 15 · 2020-07-16 20:43:15

192

Views

Bipartite-Graph GCD question

Published on 16 Jul 2020 - 20:43

List Question

Partitioning crown graphs into girth 6 diameter 3 subgraphs / packing of graphs representing finite projective planes

Matching in bipartite graph $|M|\geq \frac {n}{\Delta (G)}$.

In a bipartite graph the absolute value of any eigenvalue is less than the square root of number of edges.

Maximum number of edges of a bipartite connected graph with vertex classes of size $n$ and with no perfect matching

Which generalization of bipartite graphs is stronger?

Is there something incorrect in this question?

Perfect Matching on Bipartite Graph

Under what condition is a complete bipartite graph $K_{m,n}$ a regular graph

Graph theory: Questions about Hamiltonian cycles.

Isomorphic graphs derived from $K_{10,10}$

connected bipartite graph exists

Matchings in bipartite graph

Given a perfect fractional matching, does there exist a perfect matching with heavy edges?

A bipartite graph $K_{m,n}$ can be embedded into a surface $S$, if $\chi (S) \leq m+n - mn/2$.

Bipartite-Graph GCD question

Trending Questions

Popular # Hahtags

Popular Questions