The Erd\H{o}s-Ko-Rado theorem for twisted Grassmann graphs
Hajime Tanaka

TL;DR
This paper introduces a modern approach to the Erdős-Ko-Rado theorem, applying it to twisted Grassmann graphs, which are a specific class of Q-polynomial distance-regular graphs discovered in 2005.
Contribution
It develops a new method for Erdős-Ko-Rado theorem proofs and applies it to twisted Grassmann graphs, expanding understanding of their combinatorial properties.
Findings
Established Erdős-Ko-Rado bounds for twisted Grassmann graphs
Demonstrated the effectiveness of the modern approach in this context
Extended the theory of Q-polynomial distance-regular graphs
Abstract
We present a "modern" approach to the Erd\H{o}s-Ko-Rado theorem for Q-polynomial distance-regular graphs and apply it to the twisted Grassmann graphs discovered in 2005 by van Dam and Koolen.
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.
