Generalized oriented Hamilton cycle discrepancy conjecture via s-star

Let DD be an oriented graph on n3n\ge 3 vertices. For distinct vertices u,vu,v, call them non-adjacent if neither directed arc joins them, and define

s(D)=min{d(u)+d(v)n:uvV(D), {uv,vu}A(D)=}s^*(D)=\min\{d(u)+d(v)-n:u\ne v\in V(D),\ \{uv,vu\}\cap A(D)=\emptyset\}

when DD has a pair of non-adjacent vertices; set s(D)=n2s^*(D)=n-2 when DD is a tournament. For an oriented Hamilton cycle CC, let σmax(C)\sigma_{\max}(C) be the larger of its numbers of forward and backward arcs. s-star discrepancy conjecture. If s(D)0s^*(D)\ge 0, then there is a Hamilton oriented cycle CC in DD such that

σmax(C)n+s(D)2.\sigma_{\max}(C)\ge \left\lceil\frac{n+s^*(D)}{2}\right\rceil.

This is stated as another natural generalization of the cited Dirac-type theorem. The source presents it as open and reports supporting results for the related conjectures.

Sources & referencesView supporting material

Primary source

Jiangdong Ai, Qiwen Guo, Gregory Gutin, Yongxin Lan, Qi Shao, Anders Yeo and Yacong Zhou, “Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition”, arXiv:2501.05968 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.