Fermi
·
Concept Library
·
Courses
·
Books
·
Problems
·
Simulations
·
Math Wiki
·
High School
Fermi
›
Problems
Guichard-Combinatorics-Graph-Theory
· Problem 5.8.4
Graph Theory
Mathematics — Probability · graph-coloring
Problem
Prove theorem 5.8.10 without assuming any particular properties of the order
v
1
,
…
,
v
n
v_1, \ldots, v_n
v
1
,
…
,
v
n
.
Related theory
Graph Coloring And Chromatic Polynomials
Browse the problem library