Hamilton Cycles in Random Regular Digraphs

Colin Cooper, Alan Frieze, Michael Molloy

Source record

Source: Crossref

Published: Mar 1, 1994

DOI: 10.1017/s096354830000095x

Open original source ↗

Source abstract

We prove that almost every r -regular digraph is Hamiltonian for all fixed r ≥ 3.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.