scientific article; zbMATH DE number 7732125
From MaRDI portal
Publication:6136002
zbMATH Open1521.05073arXiv2202.05238MaRDI QIDQ6136002FDOQ6136002
Publication date: 28 August 2023
Full work available at URL: https://arxiv.org/abs/2202.05238
Title of this publication is not available (Why is that?)
Recommendations
Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of partitions of integers (05A17) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- The Theory of Round Robin Tournaments
- Counting tournament score sequences
- On the asymptotic number of tournament score sequences
- TOURNAMENTS AND PAIRED COMPARISONS
- Computation of the Number of Score Sequences in Round-Robin Tournaments
- The distribution of the number of circular triads in paired comparisons
- Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number
Cited In (15)
- Title not available (Why is that?)
- On round-robin tournaments with a unique maximum score
- Computing tournament sequence numbers efficiently with matrix techniques
- Asymptotic enumeration of tournaments with a given score sequence
- Parallel verification and enumeration of tournaments
- Counting the number of round-robin tournament schedules
- Title not available (Why is that?)
- Tournament Coding of Integer Sequences
- Title not available (Why is that?)
- Counting tournament score sequences
- Title not available (Why is that?)
- Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph
- Title not available (Why is that?)
- An algorithm to generate tournament score sequences
- Tournament sequences and Meeussen sequences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136002)
