On regular d-handicap tournaments
<p><span>A </span><em>k-regular d-handicap tournament</em><span> is an incomplete tournament in which </span><em>n</em><span> teams, ranked according to the natural numbers, play exactly </span><span class="math inline"><em>k</em> < <em>n</em> − 1</span><span> different teams exactly once and the...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2023-04-01
|
| Σειρά: | Electronic Journal of Graph Theory and Applications |
| Θέματα: | |
| Διαθέσιμο Online: | http://www.ejgta.org/index.php/ejgta/article/view/974 |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|