Ore-type oriented Hamilton cycle discrepancy conjecture
Statement
Let be an oriented graph on vertices with minimum degree . For vertices , write and for their degrees, and call them non-adjacent if neither directed arc joins them. For an oriented Hamilton cycle , let be the larger of its numbers of forward and backward arcs. Ore-type discrepancy conjecture. If
for each pair of non-adjacent vertices and , then there exists a Hamilton oriented cycle in such that
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.