Question

What’s the Absorption Method?

score 858 · Answer 1 · 2026-04-12 13:20:33

858

Views

What’s the Absorption Method?

Published on 12 Apr 2026 - 13:20

score 1.8k · Answer 2 · 2026-04-16 10:50:02

1.8k

Views

Prove that a cycle free graph with $|E| = |V|-1$ is a tree

Published on 16 Apr 2026 - 10:50

score 209 · Answer 3 · 2020-01-27 20:09:06

Graph Theory Question: Is it possible to prove that the four-color theorem holds true for a generic planar graph with seven vertices?

score 385 · Answer 4 · 2026-04-12 05:37:03

385

Views

Is there a name for a node that doesn't have any edges?

Published on 12 Apr 2026 - 5:37

score 34 · Answer 5 · 2026-04-13 18:17:44

34

Views

Using a point transformation one unit up and right of the original point to clear diagonals of points

Published on 13 Apr 2026 - 18:17

score 179 · Answer 6 · 2026-05-10 19:40:49

179

Views

What additional properties does a finite $k$-partite graph have if the endpoints of every edge have a common neighbor in each independent set?

Published on 10 May 2026 - 19:40

score 1.5k · Answer 7 · 2026-04-17 13:34:49

1.5k

Views

Normal tree(Graph Theory)

Published on 17 Apr 2026 - 13:34

score 1.4k · Answer 8 · 2026-04-17 09:04:42

1.4k

Views

Prove that every $n$-vertex graph with at least $n$ edges contains a cycle

Published on 17 Apr 2026 - 9:04

score 951 · Answer 9 · 2026-04-14 12:36:28

951

Views

Maximal Independent Set and Minimal Vertex Cover.

Published on 14 Apr 2026 - 12:36

score 2.7k · Answer 10 · 2020-01-28 10:14:03

2.7k

Views

Chromatic number is less than maximum degree + 1.

Published on 28 Jan 2020 - 10:14

score 94 · Answer 11 · 2026-05-11 08:32:38

94

Views

Effective Resistance of two joined Vertices

Published on 11 May 2026 - 8:32

score 226 · Answer 12 · 2026-05-16 22:11:26

226

Views

Is finding a clique containing at least half of the vertices in NP-complete?

Published on 16 May 2026 - 22:11

score 162 · Answer 13 · 2026-04-10 23:04:53

162

Views

Formal definition of Resistance Distance

Published on 10 Apr 2026 - 23:04

score 476 · Answer 14 · 2026-04-15 17:42:45

476

Views

How many different figures can be formed with a regular polygon of $n$ vertices and a number $d$ of diagonals of this polygon?

Published on 15 Apr 2026 - 17:42

score 816 · Answer 15 · 2026-04-15 07:17:34

What is the smallest $n$ for which loopless graphs contain non-isomorphic $n$-vertex graphs with the same degree sequence?

List Question

What’s the Absorption Method?

Prove that a cycle free graph with $|E| = |V|-1$ is a tree

Graph Theory Question: Is it possible to prove that the four-color theorem holds true for a generic planar graph with seven vertices?

Is there a name for a node that doesn't have any edges?

Using a point transformation one unit up and right of the original point to clear diagonals of points

What additional properties does a finite $k$-partite graph have if the endpoints of every edge have a common neighbor in each independent set?

Normal tree(Graph Theory)

Prove that every $n$-vertex graph with at least $n$ edges contains a cycle

Maximal Independent Set and Minimal Vertex Cover.

Chromatic number is less than maximum degree + 1.

Effective Resistance of two joined Vertices

Is finding a clique containing at least half of the vertices in NP-complete?

Formal definition of Resistance Distance

How many different figures can be formed with a regular polygon of $n$ vertices and a number $d$ of diagonals of this polygon?

What is the smallest $n$ for which loopless graphs contain non-isomorphic $n$-vertex graphs with the same degree sequence?

Trending Questions

Popular # Hahtags

Popular Questions