Scholarlink

Coclass Theorem D and Proposition 1.24 show that each coclass graph (p,r) has only finitely many maximal infinite paths. In this short chapter we investigate how many maximal infinite paths exist in (p,r); we denote this number by NrPaths(p,r) = number of maximal infinite paths in (p,r).

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The number of infinite paths in (p,r)

  • 章节

  • 发表日期：

    2026年

查看全文
  • Heiko Dietrich,
  • Bettina Eick

摘要

Coclass Theorem D and Proposition 1.24 show that each coclass graph (p,r) has only finitely many maximal infinite paths. In this short chapter we investigate how many maximal infinite paths exist in (p,r); we denote this number by NrPaths(p,r) = number of maximal infinite paths in (p,r).