On the asymptotic number of tournament score sequences
From MaRDI portal
Publication:1050350
DOI10.1016/0097-3165(83)90008-0zbMath0513.05029OpenAlexW1999595185MaRDI QIDQ1050350
Kenneth J. Winston, Daniel J. Kleitman
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(83)90008-0
Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Directed graphs (digraphs), tournaments (05C20)
Related Items (12)
The enumeration of restricted random walks by Sheffer polynomials with applications to statistics ⋮ Current trends in asymptotics: Some problems and some solutions ⋮ On some results for Bernoulli excursions ⋮ On high-dimensional acyclic tournaments ⋮ Classifying intrinsically linked tournaments by score sequence ⋮ An algorithm to generate tournament score sequences ⋮ On the Joint Path Length Distribution in Random Binary Trees ⋮ Unnamed Item ⋮ Some asymptotic formulas for lattice paths ⋮ Local asymptotics for the area of random walk excursions ⋮ Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number ⋮ q-Catalan numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Application of the Berry-Esseen inequality to combinatorial estimates
- Forests and score vectors
- Central and local limit theorems for the coefficients of polynomials of binomial type
- Permutations with nonnegative partial sums
- Some Extensions of the Wald-Wolfowitz-Noether Theorem
- A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
- Identities in Combinatorics. II: A q-Analog of the Lagrange Inversion Theorem
- An Inequality on Binomial Coefficients
- Computation of the Number of Score Sequences in Round-Robin Tournaments
This page was built for publication: On the asymptotic number of tournament score sequences
