We prove that the Grassmann graphs J2(2D+3,D)J2(2D+3,D), D≥3D≥3, are characterized by their intersection numbers, which settles one of the few remaining cases.
生成讲解博客的中文版本
生成AI智能校验的中文版本