Pages that link to "Item:Q6136002"
From MaRDI portal
The following pages link to Counting various classes of tournament score sequences (Q6136002):
Displaying 12 items.
- Counting the number of round-robin tournament schedules (Q301476) (← links)
- A characterization of unique tournaments (Q1386429) (← 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)
- Score sequences of oriented graphs (Q3360896) (← links)
- Tournament Coding of Integer Sequences (Q3568487) (← links)
- Tournaments that share several common moments with their complements (Q4853746) (← links)
- Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph (Q4943353) (← links)
- Counting tournament score sequences (Q6106038) (← links)
- On round-robin tournaments with a unique maximum score (Q6562418) (← links)