We construct an infinite family of intriguing sets that are not tight in the Grassmann Graph of planes of PG(n,q)(n,q), n≥5n≥5 odd, and show that the members of the family are the smallest possible examples if n≥9n≥9 or q≥25q≥25.
生成讲解博客的中文版本
生成AI智能校验的中文版本