Question

The probability of seeing a vertex $v_j$ in less than $K$ steps from another vertex $v_i$

score 34 · Answer 1 · 2026-03-26 08:00:40

34

Views

The probability of seeing a vertex $v_j$ in less than $K$ steps from another vertex $v_i$

Published on 26 Mar 2026 - 8:00

score 348 · Answer 2 · 2026-04-01 10:32:19

348

Views

proving that graph G is a path

Published on 01 Apr 2026 - 10:32

score 43 · Answer 3 · 2026-03-31 20:30:43

43

Views

How to find the shortest path that pass through a group of Sets?

Published on 31 Mar 2026 - 20:30

score 93 · Answer 4 · 2019-02-14 15:26:15

93

Views

I need a big regular polytope!

Published on 14 Feb 2019 - 15:26

score 95 · Answer 5 · 2026-04-06 15:04:48

95

Views

Distance metric on vector space associated with edges of an undirected graph

Published on 06 Apr 2026 - 15:04

score 211 · Answer 6 · 2026-03-25 09:50:17

211

Views

Connected planar graph with $n \geq 4$ vertices and $m$ edges, all edges in a cycle and no 2 3-cycles share an edge: show $m \leq \frac{12}{5}(n-2)$

Published on 25 Mar 2026 - 9:50

score 295 · Answer 7 · 2026-03-26 09:27:00

295

Views

Can someone check my proof for: If a tree T has maximum degree k, then it has at least k leaves.

Published on 26 Mar 2026 - 9:27

score 378 · Answer 8 · 2026-03-26 02:58:12

378

Views

Problem on graphs with more edge than a Turan number

Published on 26 Mar 2026 - 2:58

score 40 · Answer 9 · 2019-02-14 19:43:03

40

Views

Help on a graph theory question

Published on 14 Feb 2019 - 19:43

score 260 · Answer 10 · 2019-02-15 02:49:42

260

Views

If a graph has less then $2n$ vertices, then it can't have $n$ spanning trees such that each pair is edge disjoint

Published on 15 Feb 2019 - 2:49

score 53 · Answer 11 · 2026-03-25 12:27:25

53

Views

What is the term for a graph in which each edge belongs to a Hamiltonian cycle?

Published on 25 Mar 2026 - 12:27

score 1.3k · Answer 12 · 2019-02-15 06:29:32

1.3k

Views

G is k-connected, then there is a cycle in G containing all $x_i$.

Published on 15 Feb 2019 - 6:29

score 110 · Answer 13 · 2026-04-05 23:09:03

Proving that if $\delta(G)=\min\limits_{v\in V}d(v)$, there exists a path of length $\delta(G)$: confusion about construction of path using neighbors

score 84 · Answer 14 · 2019-02-15 14:10:10

84

Views

Graph Theory - Discrete math

Published on 15 Feb 2019 - 14:10

score 475 · Answer 15 · 2026-03-25 12:16:17

475

Views

Reflexive graph, meaning of the reflection

Published on 25 Mar 2026 - 12:16

List Question

The probability of seeing a vertex $v_j$ in less than $K$ steps from another vertex $v_i$

proving that graph G is a path

How to find the shortest path that pass through a group of Sets?

I need a big regular polytope!

Distance metric on vector space associated with edges of an undirected graph

Connected planar graph with $n \geq 4$ vertices and $m$ edges, all edges in a cycle and no 2 3-cycles share an edge: show $m \leq \frac{12}{5}(n-2)$

Can someone check my proof for: If a tree T has maximum degree k, then it has at least k leaves.

Problem on graphs with more edge than a Turan number

Help on a graph theory question

If a graph has less then $2n$ vertices, then it can't have $n$ spanning trees such that each pair is edge disjoint

What is the term for a graph in which each edge belongs to a Hamiltonian cycle?

G is k-connected, then there is a cycle in G containing all $x_i$.

Proving that if $\delta(G)=\min\limits_{v\in V}d(v)$, there exists a path of length $\delta(G)$: confusion about construction of path using neighbors

Graph Theory - Discrete math

Reflexive graph, meaning of the reflection

Trending Questions

Popular # Hahtags

Popular Questions