Score sequences in oriented graphs (Q874343)

The authors first give a new proof of Avery's theorem that characterizes the score sequences in oriented graphs. This new proof of Avery's theorem is obtained by using induction and is based on the proof of Landau's theorem on tournaments given by E. S. Mahmoodian and C. Thomassen. The authors also obtain some stronger inequalities for scores in oriented graphs and they characterize strongly transitive oriented graphs.