arXiv (All)
open access
Extremal Lin--Lu--Yau Curvature: Graph Density, Girth, and Short Cycles
We consider the extremal-curvature problem of optimizing a uniform discrete-curvature lower bound over positive edge weights, and develop this problem here for Lin--Lu--Yau curvature. Let $G=(V,E)$ be a finite connected graph, and let $w:E\to(0,\infty)$ be a positive edge weight. In the fixed-combin
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 circumference in regular sublinear expanders#1035593
- A Ten-Vertex Counterexample to a Conjecture on Unstable Graphs#615256
- A Ten-Vertex Counterexample to a Conjecture on Unstable Graphs#614289
- A MAC Algorithm for Energy-limited Ad-Hoc Networks#499259
- Logarithmic--exponential preparation in sharply o-minimal structures#1034468
Record · ID 986002
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