























Abstract:In 2026, Li and Zhan characterized the nonhamiltonian graphs of order $n$ with the maximum number of paths of length $k$, where $n$ and $k$ are integers satisfying $1\leq k\leq n-1$. This work solves and generalizes a problem proposed by Erdős in 1980. In this paper, we further determine the nonhamiltonian graphs of order $n$ attaining the maximum number of cycles of length $k$ for given integers $n$ and $k$ with $3\leq k\leq n-1$.
From: Lihua You [view email]
[v1]
Mon, 15 Jun 2026 14:41:14 UTC (10 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。