报告题目：On pseudo-geometric distance-regular graphs
报 告 人：Professor Jack Koolen（中国科学技术大学）
报告摘要：Neumaier (1980) showed that there are finitely many connected and coconnected strongly regular graphs with fixed smallest eigenvalue that are not Latin square of Steiner graphs. This was partly generalized by Bang and Koolen (2000's) to the class of distance-regular graphs. They showed that there are finitely many distance-regular graphs with valency at least three with fixed eigenvalue at least -m that are not geometric. In this talk we will generalize both results.
专家简介：Jack Koolen，中国科学技术大学数学科学学院教授，学术期刊Graphs and Combinatorics执行编辑。在国际期刊上发表了多篇学术论文，包括《Journal of Combinatorial Theory》、《Inventiones Mathematicae》、《Advances in Mathematics》。