arXiv (All)
open access
The asymptotic maximum oriented diameter of graphs
The oriented diameter of a connected bridgeless graph is the minimum diameter of a strong orientation. Let $f(d)$ be the maximum oriented diameter among all such graphs of diameter $d$. In 1978, Chvátal and Thomassen proved $f(d)\le2d^2+2d$ and constructed graphs showing that any quadratic upper bou
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
- An improved upper bound for oriented diameter of graphs with diameter $4$#1077454
- Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case#1084316
- Alon's Question on Connectivity Graph-Codes: $f(d)=2^d$ for Every $d\geq 4$#925335
- Alon's Question on Connectivity Graph-Codes: $f(d)=2^d$ for Every $d\geq 4$#921099
- Sharp spectral lower bounds for the booksize of a graph#1033994
Record · ID 1200311
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