2024/07/07 by Seong, Ian · 2 citations
#05E18 #05E30 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2407.06239
Let \mathbbFq denote a finite field with q elements. Let n,k denote integers with n>2k≥ 6. Let V denote a vector space over \mathbbFq that has dimension n. The vertex set of the Grassmann graph Jq(n,k) consists of the k-dimensional subspaces of V. Two vertices of Jq(n,k) are adjacent whenever their intersection has dimension k-1. Let ∂ denote the path-length distance function of Jq(n,k). Pick vertices x,y of Jq(n,k) such that 1<∂(x,y)