Guest
The talk “Forbidden subgraphs and spherical two-distance sets“ by Zilin Jiang on the Moscow Conference on Combinatorics and Applications at MIPT. Annotation: A spherical two-distance set is a set of unit vectors in d-dimensional Euclidean space such that the inner products between two distinct vectors assume only two values, say α and β. In this talk, I will connect the problem of determining the maximum size of a spherical two-distance set in R^d to forbidden subgraph characterization of signed graphs with eigenvalues bounded from below. The full schedule of the conference -
