CalcPath
Subjects
Dashboard
Diagnostic
Feedback
Search...
Graph Coloring and Ramsey Theory
Colouring vertices and edges, the chromatic number and its bounds, and the Ramsey results that make disorder impossible.
0/12 mastered
1 / 12
A graph has maximum degree
Δ
=
5
\Delta = 5
Δ
=
5
.
What upper bound on
χ
\chi
χ
does the greedy bound give?
Review the explanation for this topic →
Your answer
Draw
Hint
Type your answer — press Enter to check
Enter your answer
( )
x
n
√
⌫
AC
7
8
9
+
4
5
6
−
1
2
3
×
0
.
a
b
Check
↵
÷
#13472
All topics
All Combinatorics topics