Embedding Tournaments

摘要

Let D be a loopless digon-free directed graph on n vertices. Based on row and/or column sums, what is the smallest N such that D can be imbedded in a regular tournament on TV vertices? More particularly, what is the smallest order of a tournament with specified score sequence, which has the given digraph D as a sub-tournament? In this article, we give conditions for a specified tournament to be a subtournament of a regular tournament, originally determined by Moon.