Question

Characterization of platonic graphs

score 498 · Answer 1 · 2026-03-25 06:26:38

498

Views

Characterization of platonic graphs

Published on 25 Mar 2026 - 6:26

score 445 · Answer 2 · 2026-03-25 22:10:58

445

Views

Number of edges in Turán graph

Published on 25 Mar 2026 - 22:10

score 82 · Answer 3 · 2026-03-27 14:21:23

82

Views

Logical Induction

Published on 27 Mar 2026 - 14:21

score 663 · Answer 4 · 2018-11-09 11:49:51

663

Views

Determine all pairs (k, n) such that there exists a k-regular graph on n vertices

Published on 09 Nov 2018 - 11:49

score 29 · Answer 5 · 2018-11-09 13:14:03

29

Views

A conjecture on the coefficient of a special term in the expansion of the graph polynomial?

Published on 09 Nov 2018 - 13:14

score 336 · Answer 6 · 2026-03-25 06:22:08

336

Views

Prove that we can divide a group of 90 people into 3 groups each with 30 people so that everyone has a friend in group

Published on 25 Mar 2026 - 6:22

score 384 · Answer 7 · 2026-03-25 17:45:29

384

Views

Probability of an edge in directed random configuration graph

Published on 25 Mar 2026 - 17:45

score 319 · Answer 8 · 2018-11-09 15:10:51

319

Views

Independence number of graph below

Published on 09 Nov 2018 - 15:10

score 734 · Answer 9 · 2018-11-09 16:06:05

734

Views

Proof a formula for the number of leaves on a tree

Published on 09 Nov 2018 - 16:06

score 238 · Answer 10 · 2026-03-25 09:27:41

238

Views

Intuitive interpretation of eigenvalues of adjacency matrices of graphs.

Published on 25 Mar 2026 - 9:27

score 40 · Answer 11 · 2018-11-10 05:35:31

40

Views

$5 \mid k(k^2 +1)(k-1)^2 \implies k\not\equiv 4$ mod $5$

Published on 10 Nov 2018 - 5:35

score 418 · Answer 12 · 2018-11-10 08:49:11

418

Views

Non-isomorphic connected, unicyclic graphs

Published on 10 Nov 2018 - 8:49

score 2.1k · Answer 13 · 2026-03-25 06:28:04

2.1k

Views

Prove that a connected graph with $n$ vertices and $n+2$ edges is planar.

Published on 25 Mar 2026 - 6:28

score 652 · Answer 14 · 2018-11-10 15:40:21

652

Views

If two vertices are non-adjacent in Petersen graph then they have exactly one comon neighbour.

Published on 10 Nov 2018 - 15:40

score 110 · Answer 15 · 2026-03-25 07:43:41

110

Views

Prove that a $d$-regular, $d$-edge-connected graph $G$ is tough when $d\geq3$.

Published on 25 Mar 2026 - 7:43

List Question

Characterization of platonic graphs

Number of edges in Turán graph

Logical Induction

Determine all pairs (k, n) such that there exists a k-regular graph on n vertices

A conjecture on the coefficient of a special term in the expansion of the graph polynomial?

Prove that we can divide a group of 90 people into 3 groups each with 30 people so that everyone has a friend in group

Probability of an edge in directed random configuration graph

Independence number of graph below

Proof a formula for the number of leaves on a tree

Intuitive interpretation of eigenvalues of adjacency matrices of graphs.

$5 \mid k(k^2 +1)(k-1)^2 \implies k\not\equiv 4$ mod $5$

Non-isomorphic connected, unicyclic graphs

Prove that a connected graph with $n$ vertices and $n+2$ edges is planar.

If two vertices are non-adjacent in Petersen graph then they have exactly one comon neighbour.

Prove that a $d$-regular, $d$-edge-connected graph $G$ is tough when $d\geq3$.

Trending Questions

Popular # Hahtags

Popular Questions