| Abstract: | This paper studies the probability that a random tournament with specified score sequence contains a specified subgraph. The exact asymptotic value is found in the case that the scores are not too far from regular and the subgraph is not too large. An n‐dimensional saddle‐point method is used. As a sample application, we prove that almost all tournaments with a given score sequence (not too far from regular) have a trivial automorphism group. ©2000 John Wiley & Sons, Inc. Random Struct. Alg., 16: 47–57, 2000 |
