Timeline for Constructing an n-node DAG, with exactly k paths between node 1 and node n [closed]
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 3, 2018 at 10:10 | history | closed |
Chris Godsil Pace Nielsen Mark Wildon Kevin P. Costello ofer zeitouni |
Not suitable for this site | |
| Sep 12, 2018 at 4:14 | answer | added | Gerhard Paseman | timeline score: 0 | |
| Sep 11, 2018 at 23:17 | comment | added | Ahmed Benneji | K and n are two indépendant variables | |
| Sep 11, 2018 at 20:27 | comment | added | Ben Barber | How is $k$ related to $n$? | |
| Sep 11, 2018 at 12:52 | answer | added | Brendan McKay | timeline score: 0 | |
| Sep 11, 2018 at 12:15 | review | Close votes | |||
| Oct 3, 2018 at 10:10 | |||||
| Sep 11, 2018 at 11:45 | review | First posts | |||
| Sep 11, 2018 at 11:56 | |||||
| Sep 11, 2018 at 11:44 | history | asked | Ahmed Benneji | CC BY-SA 4.0 |