5. 5. 2025
Alexander Clifton introduces the concept of rainbow separating path systems in graphs, which distinguish every pair of edges using color-coded paths. He presents exact and asymptotically optimal bounds for various classes of graphs, including paths, cycles, spiders, and trees.