fixed latex

README.md

 # Synchronous Graph Coloring
 ## Key Concepts
 - Edges can communicate with each other
-- $\delta$ is the degree of a node
-- $\Delta$ is the maximum degree of any node in the tree
-- $\Chi$ is the Chromatic Number, i.e. the least number of colors needed to color the graph
-- Usually generic fast algorithms need $\Delta+1$ colors
-- Trees always have $\Chi\leq1$
+- $`\delta`$ is the degree of a node
+- $`\Delta`$ is the maximum degree of any node in the tree
+- $`\Chi`$ is the Chromatic Number, i.e. the least number of colors needed to color the graph
+- Usually generic fast algorithms need $`\Delta+1`$ colors
+- Trees always have $`\Chi\leq1`$
 - Log* is *how many nested logs must be taken*
-- Six-2-Three Algorithm 3-colors a tree in $\mathcal{O}(Log^* n + k)$
\ No newline at end of file
+- Six-2-Three Algorithm 3-colors a tree in $`\mathcal{O}(Log^* n + k)`$
\ No newline at end of file