Question

The class of connected graphs is not first-order axiomatizable

score 1k · Answer 1 · 2020-09-01 12:28:01

1k

Views

The class of connected graphs is not first-order axiomatizable

Published on 01 Sep 2020 - 12:28

score 98 · Answer 2 · 2020-09-05 18:03:35

98

Views

Let $G$ be a graph on $n$ vertices. Prove that if $|E| \ge 2kn$ Then $G$ Contains a path of at least length $k$

Published on 05 Sep 2020 - 18:03

score 652 · Answer 3 · 2020-09-09 20:16:02

652

Views

Determining connectivity of a graph.

Published on 09 Sep 2020 - 20:16

score 458 · Answer 4 · 2020-09-12 09:42:27

Is there a function $f : N\to N$ such that every $(k-1)$-connected graph with minimum degree at least $f(k)$ is at least $k$-connected?

score 152 · Answer 5 · 2020-09-19 11:42:44

Let $G$ be a connected graph. Prove that if $E(G)$ is greater than or equal to $V(G)$ then $G$ contains at least three edges that are not bridges.

score 759 · Answer 6 · 2020-09-20 09:40:42

759

Views

Number of Connected simple graphs with n vertices

Published on 20 Sep 2020 - 9:40

score 613 · Answer 7 · 2020-09-20 23:00:22

613

Views

A connected, simple, 3 regular graph is 2-connected

Published on 20 Sep 2020 - 23:00

score 277 · Answer 8 · 2020-09-21 07:12:32

277

Views

Proof of number of non-isomorphic connected simple graphs

Published on 21 Sep 2020 - 7:12

score 397 · Answer 9 · 2020-09-21 13:09:02

397

Views

Number of possible graphs of N vertices connected/disconnected.

Published on 21 Sep 2020 - 13:09

score 36 · Answer 10 · 2020-09-25 09:56:37

36

Views

In such a graph there two adjacent edges, s.t. their removal preserves connectivity

Published on 25 Sep 2020 - 9:56

score 91 · Answer 11 · 2020-09-25 15:09:22

91

Views

A problem about the connectivity of vertices that must have the same color for any proper minimal $4$-coloring of a graph.

Published on 25 Sep 2020 - 15:09

score 42 · Answer 12 · 2020-09-30 03:44:42

42

Views

Are beta index, and average degree of a graph the same?

Published on 30 Sep 2020 - 3:44

score 745 · Answer 13 · 2020-10-03 18:56:48

745

Views

Is Eulerian graph necessarily connected?

Published on 03 Oct 2020 - 18:56

score 90 · Answer 14 · 2020-10-08 16:06:38

90

Views

Graph Theory : Connectivity

Published on 08 Oct 2020 - 16:06

score 97 · Answer 15 · 2020-10-12 18:20:28

97

Views

Prove one city is connected to another

Published on 12 Oct 2020 - 18:20

List Question

The class of connected graphs is not first-order axiomatizable

Let $G$ be a graph on $n$ vertices. Prove that if $|E| \ge 2kn$ Then $G$ Contains a path of at least length $k$

Determining connectivity of a graph.

Is there a function $f : N\to N$ such that every $(k-1)$-connected graph with minimum degree at least $f(k)$ is at least $k$-connected?

Let $G$ be a connected graph. Prove that if $E(G)$ is greater than or equal to $V(G)$ then $G$ contains at least three edges that are not bridges.

Number of Connected simple graphs with n vertices

A connected, simple, 3 regular graph is 2-connected

Proof of number of non-isomorphic connected simple graphs

Number of possible graphs of N vertices connected/disconnected.

In such a graph there two adjacent edges, s.t. their removal preserves connectivity

A problem about the connectivity of vertices that must have the same color for any proper minimal $4$-coloring of a graph.

Are beta index, and average degree of a graph the same?

Is Eulerian graph necessarily connected?

Graph Theory : Connectivity

Prove one city is connected to another

Trending Questions

Popular # Hahtags

Popular Questions