Intriguing sets in distance regular graphs
Stefaan De Winter, Klaus Metsch

TL;DR
This paper constructs an infinite family of intriguing sets in certain distance-regular graphs, demonstrating their minimality under specific conditions, and explores their properties in the Grassmann Graph of planes.
Contribution
It introduces a new family of intriguing sets in Grassmann graphs, expanding understanding of their structure and minimal examples in high-dimensional cases.
Findings
Constructed an infinite family of intriguing sets in Grassmann graphs.
Proved these sets are the smallest possible for certain parameters.
Identified conditions under which the sets are minimal.
Abstract
We construct an infinite family of intriguing sets that are not tight in the Grassmann Graph of planes of PG, odd, and show that the members of the family are the smallest possible examples if or .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · graph theory and CDMA systems
