Media Summary: A celebrated theorem of Vizing says that every graph G of maximum degree Δ is (Δ+1)-edge-colorable. In this talk I will describe a ... This talk was part of the Workshop on "Set-Theory" held at the ESI July 4 to 8, 2022. In this talk we will investigate the interactions ... 3.1.B: On Derandomizing Local Distributed Algorithms
Anton Bernshteyn Distributed Algorithms And - Detailed Analysis & Overview
A celebrated theorem of Vizing says that every graph G of maximum degree Δ is (Δ+1)-edge-colorable. In this talk I will describe a ... This talk was part of the Workshop on "Set-Theory" held at the ESI July 4 to 8, 2022. In this talk we will investigate the interactions ... 3.1.B: On Derandomizing Local Distributed Algorithms In 1995, Levin and Linial, London, and Rabinovich conjectured that every connected graph $G$ of polynomial growth admits an ... University of South Carolina, Department of Mathematics Discrete Mathematics Seminar Date: October 22, 2021 Speaker: 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) Local Problems on Trees from the ...
By Thanh-Hai Tran, Igor Konnov and Josef Widder.
