English

An improved upper bound on the oriented diameter of graphs with diameter $4$

Combinatorics 2026-05-13 v1

Abstract

Let f(d)f(d) be the smallest value for which every bridgeless graph GG with diameter dd admits a strong orientation G\overrightarrow{G} such that the diameter of G\overrightarrow{G} is at most f(d)f(d). Chv\'atal and Thomassen (1978) established general bounds for f(d)f(d) which implies f(4)12f(4)\geq 12, and proved f(2)=6f(2)=6. Kwok et al. (2010) proved that 9f(3)119\leq f(3)\leq 11. Wang and Chen (2022) determined f(3)=9f(3)=9. Babu et al. (2021) showed f(4)21f(4)\leq 21. In this paper, we improve the upper bound of f(4) f(4) to 1818.

Keywords

Cite

@article{arxiv.2605.11667,
  title  = {An improved upper bound on the oriented diameter of graphs with diameter $4$},
  author = {Jifu Lin and Lihua You},
  journal= {arXiv preprint arXiv:2605.11667},
  year   = {2026}
}

Comments

37pages, 2 figures

R2 v1 2026-07-22T07:06:48.961Z