Pages that link to "Item:Q6106038"
From MaRDI portal
The following pages link to Counting tournament score sequences (Q6106038):
Displaying 13 items.
- Counting the number of round-robin tournament schedules (Q301476) (← links)
- Tournament scoring problem (Q924403) (← links)
- Construction of tournaments with a given score sequence (Q1318909) (← links)
- An algorithm to generate tournament score sequences (Q1410980) (← links)
- Tournament sequences and Meeussen sequences (Q1583614) (← links)
- Computing tournament sequence numbers efficiently with matrix techniques (Q1865530) (← links)
- Asymptotic enumeration of tournaments with a given score sequence (Q1906120) (← links)
- On scores in tournaments (Q2326169) (← links)
- Tournament Coding of Integer Sequences (Q3568487) (← links)
- Counting tournament brackets (Q5094673) (← links)
- Counting various classes of tournament score sequences (Q6136002) (← links)
- The stochastic sandpile model on complete graphs (Q6614181) (← links)
- A note on the lacking polynomial of the complete bipartite graph (Q6646436) (← links)