Seminar of Graph Theory - Martin Mačaj (7.3.2019)

Thursday 7.3.2019 at 9:50, Lecture room M/213

---

Martin Mačaj:
Color digraphs, coherent configurations and the Weisfeiler-Leman stabilization

Abstrakt:
A color digraph is a complete digraph in which every dart is assigned a color. Color digraphs are an important tool in various areas, e.g., combinatorics, group theory, sports, and others. Association schemes and coherent configurations form special classes of color (di)graphs, with significant applications in graph theory, group theory, statistics, coding theory ... The Weisfeiler-Leman stabilization is a polynomial time algorithm which, given a color graph $S$, provides the smallest coherent configuration $S'$ such that each color class of $S$ is union of classes of $S'$. In this talk we recall basic properties of association schemes and coherent configurations and we present the Weisfeiler-Leman stabilization. 

 

 

---