























Abstract:We consider the class of acyclic connected directed graphs with $N\geq 1$. In this paper we find the optimal upper bound for the number of paths amongst acyclic, connected graphs with $N$ edges. We prove that it is in fact optimal by finding an acyclic, connected graph with $N$ edges that realizes this bound. We then adapt these methods to find an optimal bound for Leavitt path algebras over a finite, acyclic, connected graph with $N$ edges.
From: Mateusz Lowiel [view email]
[v1]
Mon, 15 Jun 2026 01:24:03 UTC (25 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。