Intriguing sets in distance regular graphs

MaRDI QIDQ6306405zbMATH OpenFDO

Authors Stefaan De Winter, Klaus Metsch

Publication date 7 September 2018

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Association schemes, strongly regular graphs (05E30) Combinatorial structures in finite projective spaces (51E20)

Abstract: We construct an infinite family of intriguing sets that are not tight in the Grassmann Graph of planes of PG$(n,q)$, $nge5$ odd, and show that the members of the family are the smallest possible examples if $nge9$ or $qge25$.

This page was built for publication: Intriguing sets in distance regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6306405)