首页> 外文期刊>Journal of Combinatorial Theory, Series B >On the existence of graphical Frobenius representations and their asymptotic enumeration
【24h】

On the existence of graphical Frobenius representations and their asymptotic enumeration

机译:论图形Frobenius表示的存在及其渐近枚举

获取原文
获取原文并翻译 | 示例
           

摘要

We give a complete answer to the GFR conjecture, proposed by Conder, Doyle, Tucker and Watkins: "All but finitely many Frobenius groups F=N (sic) H with a given complement H have a GFR, with the exception when vertical bar H vertical bar is odd and N is Abelian but not an elementary 2-group". Actually, we prove something stronger, we enumerate asymptotically GFRs; we show that, besides the exceptions listed above, as vertical bar N vertical bar tends to infinity, the proportion of GFRs among all Cayley graphs over N containing F in their automorphism group tends to 1. (C) 2019 Elsevier Inc. All rights reserved.
机译:我们为GFR猜想提供了完整的回答,由Conder,Doyle,Tucker和Watkins提出:“所有但是有限的许多Frobenius群F = N(SIC)H具有给定补充H的GFR,但垂直栏H时异常 垂直条是奇数,n是abelian但不是基本的2组“。 实际上,我们证明了更强大的东西,我们枚举了渐近的GFRS; 我们认为,除上面列出的例外之外,由于垂直条N垂直条倾向于无限,除了无限远处,在其同网组中包含F的N个包含F的所有Cayley图中的GFR比例倾向于1.(c)2019年Elsevier Inc.保留所有权利 。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号