English

On reversing arcs to improve arc-connectivity

Combinatorics 2023-05-03 v1 Discrete Mathematics

Abstract

We show that if the arc-connectivity of a directed graph DD is at most k+12\lfloor\frac{k+1}{2}\rfloor and the reorientation of an arc set FF in DD results in a kk-arc-connected directed graph then we can reorient one arc of FF without decreasing the arc-connectivity of D.D. This improves a result of Fukuda, Prodon, Sakuma and one of Ito et al. for k{2,3}k\in\{2,3\}.

Keywords

Cite

@article{arxiv.2305.01444,
  title  = {On reversing arcs to improve arc-connectivity},
  author = {Pierre Hoppenot and Zoltán Szigeti},
  journal= {arXiv preprint arXiv:2305.01444},
  year   = {2023}
}

Comments

8 pages

R2 v1 2026-06-28T10:23:28.742Z