A digraph version of the Friendship Theorem

The Friendship Theorem states that if in a party any pair of persons has precisely one common friend, then there is always a person who is everybody's friend and the theorem has been proved by Paul Erdős, Alfréd Rényi, and Vera T. Sós in 1966. “What would happen if instead any pair of persons likes precisely one person?” While a friendship relation is symmetric, a liking relation may not be symmetric. Therefore to represent a liking relation we should use a directed graph. We call this digraph a “liking digraph”. It is easy to check that a symmetric liking digraph becomes a friendship graph if each directed cycle of length two is replaced with an edge. In this paper, we provide a digraph formulation of the Friendship Theorem which characterizes the liking digraphs. We also establish a sufficient and necessary condition for the existence of liking digraphs.