![](/files/happy5.png)
Jackson, Bill
Hamilton cycle in small d-diregular graphs ★★
Author(s): Jackson
An directed graph is -diregular if every vertex has indegree and outdegree at least
.
Conjecture For
, every
-diregular oriented graph on at most
vertices has a Hamilton cycle.
![$ d >2 $](/files/tex/6b29cd29e21416ff46f4898a33bcc7355436ee8f.png)
![$ d $](/files/tex/aeba4a4076fc495e8b5df04d874f2911a838883a.png)
![$ 4d+1 $](/files/tex/5d467147b18bddde059e7178ebf5bcf6c4b4f516.png)
Keywords:
Long directed cycles in diregular digraphs ★★★
Author(s): Jackson
Conjecture Every strong oriented graph in which each vertex has indegree and outdegree at least
contains a directed cycle of length at least
.
![$ d $](/files/tex/aeba4a4076fc495e8b5df04d874f2911a838883a.png)
![$ 2d+1 $](/files/tex/c07653873433b12792ccd825d51e97e81e93a51a.png)
Keywords:
![Syndicate content Syndicate content](/misc/feed.png)