Question

Name of Theorem for Coloring of $\{1, \dots, n\}$

score 78 · Answer 1 · 2026-03-22 19:54:21

78

Views

Name of Theorem for Coloring of $\{1, \dots, n\}$

Published on 22 Mar 2026 - 19:54

score 733 · Answer 2 · 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 265 · Answer 3 · 2026-03-22 08:00:58

265

Views

Orbit counting lemma hexagon

Published on 22 Mar 2026 - 8:00

score 508 · Answer 4 · 2026-03-20 09:10:42

508

Views

difference between colouring number and chromatic number

Published on 20 Mar 2026 - 9:10

score 107 · Answer 5 · 2026-03-19 22:42:48

107

Views

Is it a tetrahedron, 5-cell, or something else?

Published on 19 Mar 2026 - 22:42

score 59 · Answer 6 · 2026-03-20 04:51:42

59

Views

Distance of closest neighbor points in a vectorspace ${\mathbb R}^n$ (infinitesimal or zero)?

Published on 20 Mar 2026 - 4:51

score 226 · Answer 7 · 2026-03-20 11:41:37

226

Views

How to uniquely label a connected graph?

Published on 20 Mar 2026 - 11:41

score 71 · Answer 8 · 2026-03-20 10:53:11

71

Views

Graph coloring: $G$ is a graph where the number of vertices with degree of at least $k$, is at most $k$. Prove $χ(G) \le k$

Published on 20 Mar 2026 - 10:53

score 477 · Answer 9 · 2026-03-19 23:11:10

477

Views

Complete graphs in the plane with colored edges where an edge don't cross edges with same color

Published on 19 Mar 2026 - 23:11

score 494 · Answer 10 · 2026-03-20 07:10:15

494

Views

4-chromatic unit distance graph with no 4-cycles.

Published on 20 Mar 2026 - 7:10

score 102 · Answer 11 · 2026-03-20 03:37:27

102

Views

Is the graph described below bipartite?

Published on 20 Mar 2026 - 3:37

score 153 · Answer 12 · 2026-03-22 07:38:31

153

Views

An edge is adjacent to at most $2\Delta (G) -1$ edges.

Published on 22 Mar 2026 - 7:38

score 740 · Answer 13 · 2026-03-22 09:46:18

740

Views

Graph Theory: Expected value relative to the maximum of a coloring

Published on 22 Mar 2026 - 9:46

score 95 · Answer 14 · 2026-03-24 15:03:55

95

Views

Coloring the grid without any equichromatic rectangles

Published on 24 Mar 2026 - 15:03

score 231 · Answer 15 · 2026-03-20 13:35:00

231

Views

Ramsey Number Upper Bound

Published on 20 Mar 2026 - 13:35

List Question

Name of Theorem for Coloring of $\{1, \dots, n\}$

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

Orbit counting lemma hexagon

difference between colouring number and chromatic number

Is it a tetrahedron, 5-cell, or something else?

Distance of closest neighbor points in a vectorspace ${\mathbb R}^n$ (infinitesimal or zero)?

How to uniquely label a connected graph?

Graph coloring: $G$ is a graph where the number of vertices with degree of at least $k$, is at most $k$. Prove $χ(G) \le k$

Complete graphs in the plane with colored edges where an edge don't cross edges with same color

4-chromatic unit distance graph with no 4-cycles.

Is the graph described below bipartite?

An edge is adjacent to at most $2\Delta (G) -1$ edges.

Graph Theory: Expected value relative to the maximum of a coloring

Coloring the grid without any equichromatic rectangles

Ramsey Number Upper Bound

Trending Questions

Popular # Hahtags

Popular Questions