5 citations · 5 across the 3 of their papers we have counts for
1 paper · 1 filter
Daniel Bertschinger, Johannes Lengler, Anders Martinsson +4
Consider the following simple coloring algorithm for a graph on n vertices. Each vertex chooses a color from {1,…,Δ(G)+1} uniformly at random. While there exists a c…