Abstract:

Using some combinatorial techniques, the authors  gave an approximate result related to CaccettaHaggkvist conjecture, that is,  a sufficient condition α≥0.288 66  for which any digraph on n vertices with minimum outdegree at least αn contains a directed cycle of length at most 4.

Key words: digraph, directed cycle, outdegree, transitive triangle, sufficient condition