Question

Minimal disjoint chains covering graph vertex set

score 582 · Answer 1 · 2026-04-16 22:32:32

582

Views

Minimal disjoint chains covering graph vertex set

Published on 16 Apr 2026 - 22:32

score 82 · Answer 2 · 2026-04-16 02:59:17

82

Views

Graph theory: tree vertices

Published on 16 Apr 2026 - 2:59

score 8.2k · Answer 3 · 2026-04-16 15:05:27

Prove that if $deg(u)+deg(v) \geq n-1$ for every two non adjacent vertices $u$ and $v$ of $G$ then $G$ is connected and $diam(G) \leq 2$

score 568 · Answer 4 · 2026-04-17 02:29:22

Let $G$ be a disconnected graph of order $n \geq 6$ having three components. Prove that $\Delta(\overline G) \geq \frac{2n}{3}$

score 377 · Answer 5 · 2026-04-17 01:16:33

Cubic 3-edge connected graph has edge cover that can omit 2/3 of all edges over 5 graphs (so 2/15 per graph) and be 2-edge connected

score 918 · Answer 6 · 2026-04-10 18:26:59

918

Views

"Job-scheduling" problem that minimizes the number of machines

Published on 10 Apr 2026 - 18:26

score 184 · Answer 7 · 2026-04-13 16:27:13

184

Views

Show that there is a path in $G$ contain three vertices whose degree are distinct

Published on 13 Apr 2026 - 16:27

score 251 · Answer 8 · 2026-03-25 14:18:13

251

Views

Graph with largest eigenvalue "almost" $\pi$

Published on 25 Mar 2026 - 14:18

score 4.7k · Answer 9 · 2026-04-16 10:57:40

4.7k

Views

Chromatic Triangles on a $K_{17}$ graph

Published on 16 Apr 2026 - 10:57

score 80 · Answer 10 · 2026-04-14 16:45:53

80

Views

Meeting with R participants

Published on 14 Apr 2026 - 16:45

score 2.7k · Answer 11 · 2026-04-10 06:40:11

2.7k

Views

Traveling salesman problem: a worst case scenario

Published on 10 Apr 2026 - 6:40

score 591 · Answer 12 · 2026-04-16 05:10:03

591

Views

How many different graphs are there with a given degree-sequence?

Published on 16 Apr 2026 - 5:10

score 388 · Answer 13 · 2026-04-11 06:48:57

388

Views

Traveling salesman problem: can a terrible strategy beat a good one?

Published on 11 Apr 2026 - 6:48

score 255 · Answer 14 · 2026-04-15 17:03:31

255

Views

How many spanning trees does the cycle graph C2014 have?

Published on 15 Apr 2026 - 17:03

score 1.8k · Answer 15 · 2026-04-14 14:34:36

1.8k

Views

Total number of possible graphs in a network with $m$ edges and $n$ vertices?

Published on 14 Apr 2026 - 14:34

List Question

Minimal disjoint chains covering graph vertex set

Graph theory: tree vertices

Prove that if $deg(u)+deg(v) \geq n-1$ for every two non adjacent vertices $u$ and $v$ of $G$ then $G$ is connected and $diam(G) \leq 2$

Let $G$ be a disconnected graph of order $n \geq 6$ having three components. Prove that $\Delta(\overline G) \geq \frac{2n}{3}$

Cubic 3-edge connected graph has edge cover that can omit 2/3 of all edges over 5 graphs (so 2/15 per graph) and be 2-edge connected

"Job-scheduling" problem that minimizes the number of machines

Show that there is a path in $G$ contain three vertices whose degree are distinct

Graph with largest eigenvalue "almost" $\pi$

Chromatic Triangles on a $K_{17}$ graph

Meeting with R participants

Traveling salesman problem: a worst case scenario

How many different graphs are there with a given degree-sequence?

Traveling salesman problem: can a terrible strategy beat a good one?

How many spanning trees does the cycle graph C2014 have?

Total number of possible graphs in a network with $m$ edges and $n$ vertices?

Trending Questions

Popular # Hahtags

Popular Questions