Kühn–Osthus conjecture for strongly 2-connected regular digraphs

About 12 years old · traced to

Let GG be a strongly 22-connected dd-regular digraph on nn vertices, where

d≥n/3.d\geq n/3.

Kühn–Osthus conjecture. The digraph GG contains a Hamilton cycle. The source introduces this as the digraph analogue of the t=2t=2 case of the Bollobás–Häggkvist conjecture; no resolution is given in the supplied text.

References

Primary source

Allan Lo, Viresh Patel and Mehmet Akif Yıldız, “Hamilton Cycles in Dense Regular Digraphs and Oriented Graphs”, arXiv:2203.10112 (2023).

Additional references

3 papers in this index state this conjecture (2014–2022). The statement above is taken from the most recent of them; the others are arXiv:1508.05623, arXiv:1402.4754.

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.