Answers are grounded in this paper and cite their sources.
Theoretical analysis demonstrates an upper bound of d^2 + 7d - 2 in bridgeless graphs, revealing an improved quadratic leading constant of one.
Let be the smallest integer such that every bridgeless graph with has a strong orientation satisfying . In 1978, Chvátal and Thomassen proved . Later, Babu–Benson–Rajendraprasad–Vaka improved the upper bound to . We show that the leading constant can be reduced to 1: We also prove the explicit bound for every .
No takes yet. Share an insight, caveat, or question.
Ai et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: