Question

How to interpret a limit in a graph theory result

score 67 · Answer 1 · 2026-03-25 20:35:43

67

Views

How to interpret a limit in a graph theory result

Published on 25 Mar 2026 - 20:35

score 385 · Answer 2 · 2018-11-13 09:58:26

385

Views

Graphs with $\operatorname{diam}(G)=2\operatorname{rad}(G)$

Published on 13 Nov 2018 - 9:58

score 71 · Answer 3 · 2026-03-25 22:03:10

71

Views

Understand the probability formula of a random walk

Published on 25 Mar 2026 - 22:03

score 191 · Answer 4 · 2026-03-25 06:04:30

191

Views

About a proof of a proposition about maximum matching (Aho, Hopcroft, Ullman)

Published on 25 Mar 2026 - 6:04

score 85 · Answer 5 · 2018-11-13 17:34:35

85

Views

Prove that each graph with chromatic number $k$ has a definite induced sub-graph with chromatic number $k$.

Published on 13 Nov 2018 - 17:34

score 530 · Answer 6 · 2026-03-25 06:03:52

530

Views

tree has exactly $k$ nodes with degree $4$. Show that this tree has $2k+2$ leaves.

Published on 25 Mar 2026 - 6:03

score 1.8k · Answer 7 · 2026-03-26 17:51:25

1.8k

Views

Fast algorithm to remove edge to get DAG

Published on 26 Mar 2026 - 17:51

score 946 · Answer 8 · 2026-03-30 07:35:57

946

Views

Get maximum value in directed graph

Published on 30 Mar 2026 - 7:35

score 297 · Answer 9 · 2018-11-14 12:55:20

297

Views

coloring with a dihedral group $D_n$ with n prime

Published on 14 Nov 2018 - 12:55

score 185 · Answer 10 · 2026-03-30 07:37:48

185

Views

Algebraic proof involving Independent Set Problem & Maximum Degree

Published on 30 Mar 2026 - 7:37

score 308 · Answer 11 · 2026-03-26 01:16:04

308

Views

Show that a random walk on a finite grid graph is recurrent

Published on 26 Mar 2026 - 1:16

score 46 · Answer 12 · 2018-11-14 19:33:09

46

Views

Embedding the cycle metric into a real vector space with metric $l_{p}$

Published on 14 Nov 2018 - 19:33

score 171 · Answer 13 · 2026-02-23 05:09:23

171

Views

Perfect matching in the n-unit-cube, Is hyperplane statement wrong?

Published on 23 Feb 2026 - 5:09

score 271 · Answer 14 · 2026-03-25 09:09:22

271

Views

Need prove a Graphs with n >= 5 with a Euler path and without Hamilton Path and Hamilton Cycle exist.

Published on 25 Mar 2026 - 9:09

score 54 · Answer 15 · 2026-03-26 04:16:14

54

Views

Is my graph and tree proofing correct for this degree sequence?

Published on 26 Mar 2026 - 4:16

List Question

How to interpret a limit in a graph theory result

Graphs with $\operatorname{diam}(G)=2\operatorname{rad}(G)$

Understand the probability formula of a random walk

About a proof of a proposition about maximum matching (Aho, Hopcroft, Ullman)

Prove that each graph with chromatic number $k$ has a definite induced sub-graph with chromatic number $k$.

tree has exactly $k$ nodes with degree $4$. Show that this tree has $2k+2$ leaves.

Fast algorithm to remove edge to get DAG

Get maximum value in directed graph

coloring with a dihedral group $D_n$ with n prime

Algebraic proof involving Independent Set Problem & Maximum Degree

Show that a random walk on a finite grid graph is recurrent

Embedding the cycle metric into a real vector space with metric $l_{p}$

Perfect matching in the n-unit-cube, Is hyperplane statement wrong?

Need prove a Graphs with n >= 5 with a Euler path and without Hamilton Path and Hamilton Cycle exist.

Is my graph and tree proofing correct for this degree sequence?

Trending Questions

Popular # Hahtags

Popular Questions