加载中…
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 -vertex-transitive digraph of valency , then the proportion of derangements in is greater than .

生成讲解博客的中文版本

生成AI智能校验的中文版本