arXiv (All)
open access
Minimising the harmonic sum of cycle lengths
A central theme in extremal graph theory is to understand the relationship between the density of a graph and the richness of its cycle length spectrum, which is the set of distinct cycle lengths occurring in the graph. In 1966, Erdős and Hajnal suggested studying $s(G):=\sum_{\ell\in{C}(G)}1/\ell$
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Small graphs without power-of-two cycles: a lower bound of 24, a correction to a construction of Exoo, and explicit bounds for f(k)#927953
- A Tight Erdős-Stone Bound for All Graph Densities#821533
- Improved bounds for Szpiro's conjecture#1123755
- The Erdős-Gallai bound for consecutive even cycle lengths#974579
- Sparse Kahane--Salem--Zygmund Forms and Weighted Hardy--Littlewood Inequalities Across the Critical Endpoint#1156772
Record · ID 1062296
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive