Abstract:
The reachability relation of a directed acyclic graph is a partial order on the set of its vertices. One of the interesting properties of a partially ordered set is its Sperner property that means that at least one of maximum antichains is formed from elements of the same height. In graphs with the reachability relation, this property is discussed for out-trees and in-trees, it is modified and studied for functional and contrafunctional digraphs closely related to these trees, and for unoriented trees also.