Timeline for Subset of the vertices in a tournament
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jan 9 at 13:07 | history | suggested | JimN | CC BY-SA 4.0 |
Capitalized the title and added fraction in mathJax
|
| Jan 9 at 12:13 | review | Suggested edits | |||
| S Jan 9 at 13:07 | |||||
| Jan 3 at 10:21 | vote | accept | Masood | ||
| Jan 2 at 11:04 | vote | accept | Masood | ||
| Jan 3 at 10:21 | |||||
| Jan 1 at 8:05 | answer | added | Fedor Petrov | timeline score: 4 | |
| Jan 1 at 7:41 | comment | added | Masood | @bof Thanks, I have updated the question to rule out $S=\emptyset$. By complete directed graph I mean a complete graph whose edges are directed; directed complete graph is a better term. | |
| Jan 1 at 7:38 | history | edited | Masood | CC BY-SA 4.0 |
added 14 characters in body
|
| Dec 31, 2023 at 17:39 | comment | added | Fedor Petrov | @CommandMaster it probably does not work for $v$ not in $S$ | |
| Dec 31, 2023 at 16:50 | comment | added | Daniel Weber | Can't you choose $S$ to contain a single vertex? You probably want to exclude that case. | |
| Dec 31, 2023 at 15:20 | history | edited | Masood | CC BY-SA 4.0 |
edited title
|
| Dec 31, 2023 at 15:15 | history | asked | Masood | CC BY-SA 4.0 |