(1) Department of Mathematics, The University of Idaho, Moscow, IH 83844, USA, US
Abstract:
If D is a directed graph of order n≥3 with , then D contains independent directed triangles. Moreover, the condition on the minimum degree is sharp in general. Revised: April 19, 1999