Bang-Jensen et al.'s Meyniel-type conjecture for strong digraphs

Let DD be a strong digraph on nn vertices. For vertices u,vu,v of DD, write d(u)d(u) and d(v)d(v) for their total degrees. Suppose that uu and vv are non-adjacent and have a common out-neighbour or a common in-neighbour.

Bang-Jensen et al.'s conjecture. If

d(u)+d(v)2n1d(u)+d(v)\ge 2n-1

for every such pair u,vu,v, then DD is hamiltonian.

This conjecture is presented as a strengthening of the classical Meyniel theorem. Its resolution is not established in the supplied text.

Sources & referencesView supporting material

Primary source

Ruixia Wang, Linxin Wu and Wei Meng, “Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs”, arXiv:1910.05542 (2022).

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.