From d5b9bb7a65dcdcfdd9848037ff987083c8d46f7f Mon Sep 17 00:00:00 2001
From: Noah Zarro <noahzarro@gmail.com>
Date: Wed, 24 Feb 2021 14:36:50 +0100
Subject: [PATCH] fixed latex

---
 README.md | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/README.md b/README.md
index 8908089..b477dd3 100644
--- a/README.md
+++ b/README.md
@@ -1,10 +1,10 @@
 # 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
-- 
GitLab