Nash-Williams' directed Pósa-type conjecture
Nash-Williams' directed Pósa-type conjecture
Let be a digraph on vertices, with nondecreasing out-degree sequence and in-degree sequence . Nash-Williams' directed Pósa-type conjecture. If for every , and, when is odd, additionally , then contains a Hamilton cycle. This is presented as a weakening of Nash-Williams' directed degree-sequence conjecture and would yield a directed analogue of Pósa's theorem; its resolution is not given in the source.
Sources & referencesView supporting material
Primary source
Zhilan Wang and Jin Yan, “The H-linkage problems in sparse robustly expanding digraphs”, arXiv:2604.27452 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.