Question

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

score 93 · Answer 1 · 2026-05-05 09:32:50

93

Views

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

Published on 05 May 2026 - 9:32

score 745 · Answer 2 · 2026-05-06 16:58:19

745

Views

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

Published on 06 May 2026 - 16:58

score 274 · Answer 3 · 2026-04-29 12:20:06

274

Views

Orbit counting lemma hexagon

Published on 29 Apr 2026 - 12:20

score 519 · Answer 4 · 2026-05-03 08:54:14

519

Views

difference between colouring number and chromatic number

Published on 03 May 2026 - 8:54

score 117 · Answer 5 · 2026-05-05 06:02:50

117

Views

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

Published on 05 May 2026 - 6:02

score 68 · Answer 6 · 2026-05-03 08:51:30

68

Views

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

Published on 03 May 2026 - 8:51

score 237 · Answer 7 · 2026-04-29 12:20:31

237

Views

How to uniquely label a connected graph?

Published on 29 Apr 2026 - 12:20

score 81 · Answer 8 · 2026-05-03 08:53:38

81

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 03 May 2026 - 8:53

score 491 · Answer 9 · 2026-05-07 19:12:14

491

Views

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

Published on 07 May 2026 - 19:12

score 503 · Answer 10 · 2026-05-04 03:56:37

503

Views

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

Published on 04 May 2026 - 3:56

score 108 · Answer 11 · 2026-04-29 12:19:58

108

Views

Is the graph described below bipartite?

Published on 29 Apr 2026 - 12:19

score 159 · Answer 12 · 2026-04-29 12:19:58

159

Views

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

Published on 29 Apr 2026 - 12:19

score 745 · Answer 13 · 2026-04-29 12:19:59

745

Views

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

Published on 29 Apr 2026 - 12:19

score 101 · Answer 14 · 2026-04-29 12:19:55

101

Views

Coloring the grid without any equichromatic rectangles

Published on 29 Apr 2026 - 12:19

score 239 · Answer 15 · 2026-04-29 12:20:13

239

Views

Ramsey Number Upper Bound

Published on 29 Apr 2026 - 12:20

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