Click here to flash read.
arXiv:2311.05575v2 Announce Type: replace
Abstract: Given a permutation group $G$, the derangement graph of $G$ is the Cayley graph with connection set the derangements of $G$. The group $G$ is said to be innately transitive if $G$ has a transitive minimal normal subgroup. Clearly, every primitive group is innately transitive. We show that, besides an infinite family of explicit exceptions, there exists a function $f:\mathbb{N}\to \mathbb{N}$ such that, if $G$ is innately transitive of degree $n$ and the derangement graph of $G$ has no clique of size $k$, then $n\le f(k)$.
Motivation for this work arises from investigations on Erd\H{o}s-Ko-Rado type theorems for permutation groups.
Click here to read this post out
ID: 820983; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: April 24, 2024, 7:33 a.m.
Changes:
Dictionaries:
Words:
Spaces:
Views: 11
CC:
No creative common's license
No creative common's license
Comments: