The polytope of win vectors

N. Alon, A. Frieze, and D. Welsh, Polynomial time randomized approximation schemes for Tutte-Grothendieck invariants: the dense case, Random Structures and Algorithms6(4) (1995) 459–478.

J.D. Annan, A randomised approximation algorithm for counting the number of forests in dense graphs, Combin., Probab. and Comput.3 (1994) 273–283.

M. Crawley and R. May, Population dynamics and plant community structure: competition between annuals and perennials, J. Theoret. Biology125 (1987) 475–489.

M. Dyer, R. Kannan, and J. Mount Sampling contingency tables, Random Structures and Algorithms, to appear.

J. Edmonds, Submodular functions, matroids, and certain polyhedra, In: Combinatorial Structures and their Applications, Proc. Calgary Internat. Conf., Calgary, Alta., 1969, H. Hanani, N. Sauer, and J. Schönheim, Eds., Gordon and Breach, New York, 1970, pp. 69–87.

J.D. Gibbons, I. Olkin, and M. Soebel, Baseball competitions: are enough games played? Amer. Statistician32 (1978) 89–95.

F. Jaeger, D. Vertigan, and D. Welsh, On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Cambridge Philos. Soc.108 (1990) 35–53.

T. Jech, The ranking of incomplete tournaments: a mathematician's guide to popular sports, Amer. Mathemat. Monthly90 (1983) 246–266.

R. Kannan, P. Tetali, and S. Vempala, Simple Markov chain algorithms for generating bipartite graphs and tournaments, preprint, 1996.

D.J. Kleitman and K.J. Winston, Forests and score vectors, Combinatorica1 (1981) 49–54.

H. Kullmann, Personal communication, 1996.

L. Lovasz and M. Simonovits, Random walks in a convex body and an improved volume algorithm, Random Structures and Algorithms4(4) (1993) 359–412.

C.A. McGilchrist and B.R. Trenbath, A revised analysis of plant competition experiments, Biometrics27 (1971) 659–671.

R. Mead, Competition experiments, Biometrics35 (1979) 41–54.

J. Moon, Topics on Tournaments, Holt, Rinehart and Winston, New York, 1968.

K. Reid and L. Beineke, Tournaments In: Selected Topics in Graph Theory, L. Beineke and R. Wilson, Eds., Academic Press, New York, 1978, pp. 169–204.

G. Shephard, Combinatorial properties of associated zonotopes, Canad. J. Math.26(2) (1974) 302–321.

R.P. Stanley, Enumerative Combinatorics, Vol. I, Wadsworth & Brooks/cole, Monterey, California, 1986.

R.P. Stanley, Decompositions of rational convex polytopes, Ann. Discrete Math.6(6) (1980) 333–342.

D.M. Topkis, Adjacency on polymatroids, Math. Programming30 (1984) 229–237.

D.J.A. Welsh, Matroid Theory, Academic Press, London, 1976.

D.J.A. Welsh, Counting colourings and flows in random graphs, In: Combinatorics-Paul Erdös is Eighty, Janos Bolyai Math. Soc., Budapest, 1996, pp. 491–505.

H.S. Wilf, Generatingfunctionology, Academic Press, London, 1990.