On derangements and suborbits in finite transitive groups

Discrete Mathematics(2024)

引用 0|浏览0
暂无评分
摘要
We find a lower bound on the proportion of derangements in a finite transitive group that depends on the minimal nontrivial subdegree. As a consequence, we prove that, if Γ is a G-vertex-transitive digraph of valency d≥1, then the proportion of derangements in G is greater than 1/2d.
更多
查看译文
关键词
Derangement,Bounded valency,Vertex-transitive,Subdegree
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要