Question

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

score 166 · Answer 1 · 2026-03-19 23:59:47

166

Views

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

Published on 19 Mar 2026 - 23:59

score 64 · Answer 2 · 2026-03-22 04:14:04

64

Views

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

Published on 22 Mar 2026 - 4:14

score 186 · Answer 3 · 2026-03-23 00:20:02

186

Views

A certain partition of 28

Published on 23 Mar 2026 - 0:20

score 233 · Answer 4 · 2026-03-22 11:22:38

233

Views

decomposing a graph in connected components

Published on 22 Mar 2026 - 11:22

score 733 · Answer 5 · 2026-03-20 19:04:23

733

Views

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

Published on 20 Mar 2026 - 19:04

score 240 · Answer 6 · 2026-03-21 17:37:28

240

Views

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

Published on 21 Mar 2026 - 17:37

score 686 · Answer 7 · 2026-03-20 00:31:32

686

Views

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

Published on 20 Mar 2026 - 0:31

score 71 · Answer 8 · 2026-03-22 20:21:34

71

Views

Inequality on degrees implies perfect matching

Published on 22 Mar 2026 - 20:21

score 660 · Answer 9 · 2026-03-20 00:47:22

660

Views

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

Published on 20 Mar 2026 - 0:47

score 66 · Answer 10 · 2026-03-19 13:48:55

66

Views

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

Published on 19 Mar 2026 - 13:48

score 332 · Answer 11 · 2026-03-21 22:16:35

332

Views

bijection between graphs

Published on 21 Mar 2026 - 22:16

score 362 · Answer 12 · 2026-03-22 13:07:15

362

Views

Prove that a simple connected graph has even numbers of vertex

Published on 22 Mar 2026 - 13:07

score 64 · Answer 13 · 2026-03-24 14:49:06

64

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 24 Mar 2026 - 14:49

score 76 · Answer 14 · 2026-03-20 09:31:03

76

Views

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

Published on 20 Mar 2026 - 9:31

score 171 · Answer 15 · 2026-03-20 12:01:08

171

Views

Cardinality of the largest clique in an octahedron

Published on 20 Mar 2026 - 12:01

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