Contents

-

Chvatal-Erdos Condition for Hamiltonicity in Digraphs

Carlos Guia1, Oscar Ordaz1
1Departamento de Matematicas, Facultad de Ciencias Universidad Central de Venezuela Ap. 47567, Caracas 1041-A, Venezuela.

Abstract

Our purpose is to determine the minimum integer fi(m) (gi(m), hi(m) respectively) for every natural m, such that every digraph D, fi(m)-connected, (gi(m), hi(m)-connected respectively) and αi(D)m is hamiltonian (D has a hamilton path, D is hamilton connected respectively), (i=0,1,2). We give exact values of fi(m) and gi(m) for some particular values of m. We show the existence of h2(m) and that h2(1)=1, h2(2)=4 hold.