Nash-Williams' directed Pósa-type conjecture

Let DD be a digraph on n3n\geq 3 vertices, with nondecreasing out-degree sequence d1+dn+d_1^+\leq\cdots\leq d_n^+ and in-degree sequence d1dnd_1^-\leq\cdots\leq d_n^-. Nash-Williams' directed Pósa-type conjecture. If di+,dii+1d_i^+,d_i^-\geq i+1 for every 1i<(n1)/21\leq i<(n-1)/2, and, when nn is odd, additionally dn/2+,dn/2n/2d^+_{\lceil n/2\rceil},d^-_{\lceil n/2\rceil}\geq\lceil n/2\rceil, then DD 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

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.