Intriguing sets in distance regular graphs

2018/09/07 by Stefaan De Winter, De Winter, Stefaan, Klaus Metsch +1
Computer Science · Engineering · Mathematics · #05B25 #05E30 #51E20 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems #math.CO #msc:05B25 #msc:05E30 #msc:51E20

paper · pdf · doi:10.48550/arxiv.1809.02644

arxiv created 2018/09/07 · openalex publication_date 2018/09/07 · arxiv updated 2018/09/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We construct an infinite family of intriguing sets that are not tight in the Grassmann Graph of planes of PG(n,q), n≥ 5 odd, and show that the members of the family are the smallest possible examples if n≥ 9 or q≥ 25.

Related

• On intriguing sets in five classes of strongly regular graphs
• Strongly regular graphs from integral point sets in even dimensional affine spaces over finite fields
• Geometric constructions of small regular graphs with girth 7
• No finite 5-regular matchstick graph exists
• Almost-bipartite distance-regular graphs with the Q-polynomial property