Question

characterisation of $2$-connected graphs with no even cycles

score 184 · Answer 1 · 2026-05-05 17:36:09

184

Views

characterisation of $2$-connected graphs with no even cycles

Published on 05 May 2026 - 17:36

score 78 · Answer 2 · 2026-05-05 20:52:10

78

Views

Explanation for the static degree sort algorithm of Deo et al.

Published on 05 May 2026 - 20:52

score 198 · Answer 3 · 2026-05-05 11:46:37

198

Views

A certain partition of 28

Published on 05 May 2026 - 11:46

score 245 · Answer 4 · 2026-05-05 14:40:34

245

Views

decomposing a graph in connected components

Published on 05 May 2026 - 14:40

score 745 · Answer 5 · 2026-05-06 16:58:19

745

Views

Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?

Published on 06 May 2026 - 16:58

score 251 · Answer 6 · 2026-05-07 10:09:47

251

Views

Fake induction, can't find flaw, every graph with zero edges is connected

Published on 07 May 2026 - 10:09

score 699 · Answer 7 · 2026-05-07 19:07:27

699

Views

Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors

Published on 07 May 2026 - 19:07

score 87 · Answer 8 · 2026-05-05 11:22:10

87

Views

Inequality on degrees implies perfect matching

Published on 05 May 2026 - 11:22

score 674 · Answer 9 · 2026-05-07 07:41:04

674

Views

Proving that no two teams in a tournament win same number of games

Published on 07 May 2026 - 7:41

score 80 · Answer 10 · 2026-05-07 10:09:52

80

Views

Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one

Published on 07 May 2026 - 10:09

score 340 · Answer 11 · 2026-04-29 12:21:57

340

Views

bijection between graphs

Published on 29 Apr 2026 - 12:21

score 370 · Answer 12 · 2026-05-06 11:53:28

370

Views

Prove that a simple connected graph has even numbers of vertex

Published on 06 May 2026 - 11:53

score 74 · Answer 13 · 2026-05-07 10:08:41

74

Views

Does every connected topological space have the property that you can walk around a finite open cover to get from any point to any other?

Published on 07 May 2026 - 10:08

score 87 · Answer 14 · 2026-05-05 14:14:32

87

Views

Is the largest eigenvalue of $A$ is greater than that of $B$?

Published on 05 May 2026 - 14:14

score 180 · Answer 15 · 2026-05-05 15:48:44

180

Views

Cardinality of the largest clique in an octahedron

Published on 05 May 2026 - 15:48

List Question

characterisation of $2$-connected graphs with no even cycles

Explanation for the static degree sort algorithm of Deo et al.

A certain partition of 28

decomposing a graph in connected components

Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?

Fake induction, can't find flaw, every graph with zero edges is connected

Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors

Inequality on degrees implies perfect matching

Proving that no two teams in a tournament win same number of games

Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one

bijection between graphs

Prove that a simple connected graph has even numbers of vertex

Does every connected topological space have the property that you can walk around a finite open cover to get from any point to any other?

Is the largest eigenvalue of $A$ is greater than that of $B$?

Cardinality of the largest clique in an octahedron

Trending Questions

Popular # Hahtags

Popular Questions