ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be an oriented graph on n≥3n\ge 3 vertices with minimum degree δ\delta. For vertices u,vu,v, write d(u)d(u) and d(v)d(v) for their degrees, and call them non-adjacent if neither directed arc joins them. For an oriented Hamilton cycle CC, let σmax⁡(C)\sigma_{\max}(C) be the larger of its numbers of forward and backward arcs. Ore-type discrepancy conjecture. If

d(u)+d(v)≥nd(u)+d(v)\ge n

for each pair of non-adjacent vertices uu and vv, then there exists a Hamilton oriented cycle CC in DD such that

σmax⁡(C)≥max⁡{δ,n−δ}.\sigma_{\max}(C)\ge \max\{\delta,n-\delta\}.

This conjecture extends the cited Dirac-type result from a minimum-degree condition to an Ore-type condition. It is presented as open; the authors state that they could not prove it but provide supporting results, and the bound is sharp in the discussed cases.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.