From 6cb55d904cf2b5dc037f1cadd58c89f3ec5698e0 Mon Sep 17 00:00:00 2001 From: Pagwin Date: Tue, 27 May 2025 21:03:32 -0400 Subject: [PATCH] correction --- posts/tolerant-graph-synchronization.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/posts/tolerant-graph-synchronization.md b/posts/tolerant-graph-synchronization.md index 95b4e46..a2ffd67 100644 --- a/posts/tolerant-graph-synchronization.md +++ b/posts/tolerant-graph-synchronization.md @@ -51,7 +51,7 @@ The reason I don't include those yet is because I'm not sure what needs to be in I suspect (with my gut) the optimal solution is just to have the initial non-black node be red and then have the rule "if any neighbors are red turn red". -I don't know if exponential graphs like social graphs mess that solution up though or if all the alternatives do no better. +I don't know if ~~exponential graphs~~(edit: made up a term oops) scale-free networks like social graphs mess that solution up though or if all the alternatives do no better. ## Conclusion