Let $G$ be the graph on $\Bbb N$ such that there is an edge between $n$ and $m$ when $|n-m|$ is prime. Can we color $G$ with a finite number of colors

score 945 · Answer 10 · 2019-07-16 07:02:21

945

Views

Upper bound on the number of edges given number of vertices, girth and maximum degree

Published on 16 Jul 2019 - 7:02

score 241 · Answer 11 · 2026-03-25 14:46:54

241

Views

Can the vertices of a planar graph of min degree 3 be covered with edges of average weight ( sum of degrees) at most 13?

Published on 25 Mar 2026 - 14:46

score 1.6k · Answer 12 · 2026-03-25 06:01:19

1.6k

Views

How is the adjacency matrix of a directed graph normalized?

Published on 25 Mar 2026 - 6:01

score 47 · Answer 13 · 2026-04-13 17:47:48

47

Views

Creating a graph from a Hermitian matrix that is $d$-sparse

Published on 13 Apr 2026 - 17:47

score 725 · Answer 14 · 2019-07-16 22:01:43

725

Views

Number of paths of length $P_{n-1}$ in $K_n$?

Published on 16 Jul 2019 - 22:01

score 90 · Answer 15 · 2026-04-12 18:06:35

90

Views

Full Change Graphs

Published on 12 Apr 2026 - 18:06

List Question

Term for the relation between points A and B of a directed graph such that there exists at least one vertex accessible from A but not from B?

Quantity of minimal cut-sets between a pair of vertices

A magician places $n$ coins on a table and walks down off the stage.

Troubles in understanding Sperner's Lemma proof

Algorithm to find MST in a weighted acyclic directed graph

Chromatic Polynomial (well-defined?)

Does knowing a graph has a Hamiltonian Cycle make it easier to find the cycle?

Is the stability of an ordered digraph $D$ equal to the number of pairwisely disjoint directed paths covering $D$?

Let $G$ be the graph on $\Bbb N$ such that there is an edge between $n$ and $m$ when $|n-m|$ is prime. Can we color $G$ with a finite number of colors

Upper bound on the number of edges given number of vertices, girth and maximum degree

Can the vertices of a planar graph of min degree 3 be covered with edges of average weight ( sum of degrees) at most 13?

How is the adjacency matrix of a directed graph normalized?

Creating a graph from a Hermitian matrix that is $d$-sparse

Number of paths of length $P_{n-1}$ in $K_n$?

Full Change Graphs

Trending Questions

Popular # Hahtags

Popular Questions