Question

Find a graph with at least two vertices and no self-loops in which all vertices have different degrees

score 311 · Answer 1 · 2026-04-15 22:23:04

311

Views

Find a graph with at least two vertices and no self-loops in which all vertices have different degrees

Published on 15 Apr 2026 - 22:23

score 589 · Answer 2 · 2026-04-15 23:19:41

589

Views

Prove a 4-cycle exists in a graph with 100 vertices, each with degree of atleast 50

Published on 15 Apr 2026 - 23:19

score 693 · Answer 3 · 2026-04-16 17:33:53

693

Views

Graph Theory proof: Let G be a planar graph that doesn't contain K3...

Published on 16 Apr 2026 - 17:33

score 71 · Answer 4 · 2026-04-16 00:26:48

71

Views

Proof that in a graph of $2$ or more vertrex, there's at least $2$ of them that have the same degree

Published on 16 Apr 2026 - 0:26

score 4.6k · Answer 5 · 2026-04-14 15:35:48

4.6k

Views

Formula for position in an upper triangular matrix

Published on 14 Apr 2026 - 15:35

score 259 · Answer 6 · 2026-04-17 13:39:56

259

Views

Probability there is no vertex at distance larger than $d$ away from source in random graph?

Published on 17 Apr 2026 - 13:39

score 10.7k · Answer 7 · 2026-04-11 12:41:47

10.7k

Views

Wolf cabbage and goat using dijkstra.

Published on 11 Apr 2026 - 12:41

score 1.7k · Answer 8 · 2026-04-16 10:34:34

1.7k

Views

2-Connected Graph

Published on 16 Apr 2026 - 10:34

score 370 · Answer 9 · 2026-04-13 19:19:35

370

Views

Finding quantity of vertex of odd degree in a graph

Published on 13 Apr 2026 - 19:19

score 596 · Answer 10 · 2026-04-15 14:29:17

596

Views

3-connectedness Expansion Lemma

Published on 15 Apr 2026 - 14:29

score 84 · Answer 11 · 2026-04-14 14:51:37

84

Views

Random (Union Find) Spanning Tree, probability of resulting with two unconnected halves before the last step?

Published on 14 Apr 2026 - 14:51

score 378 · Answer 12 · 2026-04-13 00:09:44

378

Views

How to represent argmax function for this graph?

Published on 13 Apr 2026 - 0:09

score 17.6k · Answer 13 · 2026-04-17 09:00:51

17.6k

Views

Proof that any self-complementary graph has to have $4k$ or $4k+1$ vertex, for some $k \in \mathbb N$

Published on 17 Apr 2026 - 9:00

score 74 · Answer 14 · 2026-04-16 23:20:53

74

Views

Elementary graph coloring

Published on 16 Apr 2026 - 23:20

score 926 · Answer 15 · 2026-04-15 08:59:57

926

Views

Maximal flow and minimal cut in complete graphs

Published on 15 Apr 2026 - 8:59

List Question

Find a graph with at least two vertices and no self-loops in which all vertices have different degrees

Prove a 4-cycle exists in a graph with 100 vertices, each with degree of atleast 50

Graph Theory proof: Let G be a planar graph that doesn't contain K3...

Proof that in a graph of $2$ or more vertrex, there's at least $2$ of them that have the same degree

Formula for position in an upper triangular matrix

Probability there is no vertex at distance larger than $d$ away from source in random graph?

Wolf cabbage and goat using dijkstra.

2-Connected Graph

Finding quantity of vertex of odd degree in a graph

3-connectedness Expansion Lemma

Random (Union Find) Spanning Tree, probability of resulting with two unconnected halves before the last step?

How to represent argmax function for this graph?

Proof that any self-complementary graph has to have $4k$ or $4k+1$ vertex, for some $k \in \mathbb N$

Elementary graph coloring

Maximal flow and minimal cut in complete graphs

Trending Questions

Popular # Hahtags

Popular Questions