2 papers
math.CO2026
Limit Laws for Consensus Protocols on the Complete Graph
Julian Becker, Konstantinos Panagiotou
We study a distributed consensus problem on a complete communication network of vertices, each holding one of two opinions. The vertices communicate in rounds, possibly in the…
math.CO2026
Improved Universal Graphs for Trees
Julian Becker, Konstantinos Panagiotou, Matija Pasch
A graph is universal for a class of graphs , if, up to isomorphism, contains every graph in as a subgraph. In 1978, Chung and Graham asked for th…