Question

Prove that if a path exists between two vertices $u$ and $v$ in a directed or undirected graph, a simple path exists between $u$ and $v$.

score 1.1k · Answer 1 · 2026-04-15 08:38:56

Prove that if a path exists between two vertices $u$ and $v$ in a directed or undirected graph, a simple path exists between $u$ and $v$.

score 46 · Answer 2 · 2026-04-11 20:46:53

46

Views

Clarifying with notation

Published on 11 Apr 2026 - 20:46

score 79 · Answer 3 · 2026-04-10 15:46:26

79

Views

Is this a Spanning Tree?

Published on 10 Apr 2026 - 15:46

score 506 · Answer 4 · 2026-04-13 06:44:48

506

Views

Self-complementary and bipartite graphs

Published on 13 Apr 2026 - 6:44

score 172 · Answer 5 · 2026-04-16 17:08:09

172

Views

planar graph orientation

Published on 16 Apr 2026 - 17:08

score 546 · Answer 6 · 2026-04-15 04:29:35

546

Views

The minimum $N \times N$ square covering problem for $1 \times 4$ shaped tetrominoes

Published on 15 Apr 2026 - 4:29

score 394 · Answer 7 · 2026-04-13 23:59:12

394

Views

Does this property characterize minimum spanning trees?

Published on 13 Apr 2026 - 23:59

score 227 · Answer 8 · 2026-04-16 00:45:16

227

Views

Prove the statements are equivalent for a directed graph $(V, E)$ and linear map $\partial:\Bbb R[E]\rightarrow\Bbb R[V]$

Published on 16 Apr 2026 - 0:45

score 381 · Answer 9 · 2026-04-15 12:01:40

381

Views

What is the expectation of the order of automorphism group in Erdos-Renyi random graphs?

Published on 15 Apr 2026 - 12:01

score 84 · Answer 10 · 2026-04-16 13:24:56

84

Views

Is this graph-problem NP-Hard?

Published on 16 Apr 2026 - 13:24

score 280 · Answer 11 · 2026-04-14 07:34:15

280

Views

Statistical Proof of Turán’s Graph Theorem: Weight of Vertex Uniformly Distributed?

Published on 14 Apr 2026 - 7:34

score 25 · Answer 12 · 2026-04-14 17:44:56

25

Views

Using linear map $\partial:\Bbb R[E]\rightarrow\Bbb R[V]$ to prove that $\#V-\#W=1$ for a tree

Published on 14 Apr 2026 - 17:44

score 186 · Answer 13 · 2026-04-14 01:48:46

186

Views

Max-Cut approximation algorithm

Published on 14 Apr 2026 - 1:48

score 47 · Answer 14 · 2026-04-14 16:15:52

47

Views

Prove: If a connected graph $K$ has $n$ vertices and $x$ edges with $x > n − 1$, will it contain a cycle?

Published on 14 Apr 2026 - 16:15

score 154 · Answer 15 · 2026-03-25 06:04:20

154

Views

What's the $2N-$power of adjacency matrix $A$ of a directed tree?

Published on 25 Mar 2026 - 6:04

List Question

Prove that if a path exists between two vertices $u$ and $v$ in a directed or undirected graph, a simple path exists between $u$ and $v$.

Clarifying with notation

Is this a Spanning Tree?

Self-complementary and bipartite graphs

planar graph orientation

The minimum $N \times N$ square covering problem for $1 \times 4$ shaped tetrominoes

Does this property characterize minimum spanning trees?

Prove the statements are equivalent for a directed graph $(V, E)$ and linear map $\partial:\Bbb R[E]\rightarrow\Bbb R[V]$

What is the expectation of the order of automorphism group in Erdos-Renyi random graphs?

Is this graph-problem NP-Hard?

Statistical Proof of Turán’s Graph Theorem: Weight of Vertex Uniformly Distributed?

Using linear map $\partial:\Bbb R[E]\rightarrow\Bbb R[V]$ to prove that $\#V-\#W=1$ for a tree

Max-Cut approximation algorithm

Prove: If a connected graph $K$ has $n$ vertices and $x$ edges with $x > n − 1$, will it contain a cycle?

What's the $2N-$power of adjacency matrix $A$ of a directed tree?

Trending Questions

Popular # Hahtags

Popular Questions