Hypohamiltonian/hypotraceable Digraphs Abound

Zdzislaw Skupien1
1Institute of Math. AGH, al. Mickiewicza 30, 30-059 Krakow, Poland

Abstract

The number of hypohamiltonian and that of hypotraceable \(n\)-vertex digraphs are both bounded below by a superexponential function of \(n\) for \(n \geq 6\) and \(n \geq 7\), respectively.