Neumaier graphs

主 讲 人 ：Rhys Evans    

活动时间：04月02日10时30分    

地      点 ：理科群1号楼D203室

讲座内容：

In the early 1980s, Neumaier studied regularcliques in edge-regular graphs, and a certain class of designs whose pointgraphs are strongly regular and contain regular cliques. He then posed theproblem of whether there exists a non-complete, edge-regular, non-stronglyregular graph containing a regular clique. We thus define a strictly Neumaiergraph to be a non-complete, edge-regular, non-strongly regular graph containinga regular clique. It was not until 2018 that a solution to this problem wasgiven, and currently only a handful of constructions for infinite families ofstrictly Neumaier graphs are known.

In this talk we will review the major resultsregarding (strictly) Neumaier graphs, with an emphasis on the construction ofNeumaier graphs.

主讲人介绍：

RhysEvans，斯洛文尼亚数学、物理和力学研究所（Instituteof Mathematics, Physics and Mechanics, Slovenia）博士后。

发布时间：2024-03-28 09:18:05