On the intersection density of the Kneser Graph $K(n,3)$
Karen Meagher, Andriaherimanana Sarobidy Razafimahatratra

TL;DR
This paper investigates the intersection density of the Kneser graph $K(n,3)$, determining it for cases where the automorphism group contains $ ext{PSL}_2(q)$, and explores related properties for $K(n,2)$.
Contribution
It provides the first explicit determination of the intersection density of $K(n,3)$ under certain automorphism group conditions, expanding understanding of intersecting sets in Kneser graphs.
Findings
Intersection density of $K(n,3)$ is determined when automorphism group contains $ ext{PSL}_2(q)$.
Explicit results depend on the congruence class of $q$.
Brief analysis of intersection density for $K(n,2)$ with $ ext{PSL}_2(q)$ subgroup presence.
Abstract
A set is \textsl{intersecting} if any two of its elements agree on some element of . Given a finite transitive permutation group , the \textsl{intersection density} is the maximum ratio where runs through all intersecting sets of . The \textsl{intersection density} of a vertex-transitive graph is equal to \max \left\{ \rho(G) : G \leq \operatorname{Aut}(X), \mbox{ G transitive} \right\}. In this paper, we study the intersection density of the Kneser graph , for . The intersection density of is determined whenever its automorphism group contains , with some exceptional cases depending on the congruence of . We also briefly consider the intersection density of for…
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 · Limits and Structures in Graph Theory · Advanced Graph Theory Research
