We define a fractional version of the notion of ''kernels'' in digraph
s and prove that every clique-acyclic digraph (i.e., one in which no c
lique contains a cycle) has a fractional kernel. Using this we give a
short proof of a recent result of Bores and Gurvich (proving a conject
ure of Berge and Duchet) that every clique-acyclic orientation of a pe
rfect graph has a kernel. (C) 1998 Academic Press.