Treewidth of the q-Kneser graphs

2021/01/10 by Mengyu Cao, Cao, Mengyu, Ke Liu +5
Computer Science · Mathematics · #05C75 #05D05 #Advanced Graph Theory Research #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research

paper · pdf · doi:10.48550/arxiv.2101.04518

openalex publication_date 2021/01/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let V be an n-dimensional vector space over a finite field \mathbbF_q, where q is a prime power. Define the generalized q-Kneser graph K_q(n,k,t) to be the graph whose vertices are the k-dimensional subspaces of V and two vertices F₁ and F₂ are adjacent if dim(F₁∩ F₂)

Related

• On the treewidth of generalized q-Kneser graphs
• Treewidth of the generalized Kneser graphs
• On the treewidth of generalized Kneser graphs
• Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
• On the P₃ -hull numbers of q -Kneser graphs and Grassmann graphs