报告人：南方科技大学 Ferdinand Ihringer 助理教授

题目：Design Switching and Strongly Regular Graphs

时间：2025年10月24日，下午4：00 – 5:30

腾讯会议：数学楼2-3会议室

摘要：A graph is called \textit{strongly regular} with parameters $(v, k, \lambda, \mu)$ if it has $v$ vertices, each vertex has degree $k$, two adjacent vertices have precisely $\lambda$ common neighbors, and two nonadjacent vertices have precisely $\mu$ common neighbors. We will discuss a few ways of modifying a strongly regular graph by \textit{design switching}, a switching method which covers many known techniques such as GM-switching or WQH-switching.

简介：Ferdinand Ihringer，南方科技大学数学系tenure-track助理教授，主要研究兴趣包括极值组合、有限几何、图谱理论以及编码等，他目前已经发表研究论文40 余篇，从2025年起担任著名期刊“Journal of Combinatorial Theory, Series A ”编委。