Timeline for How many edge-disjoint paths go from upper left to lower right in a $4 \times N$ rectangular gridwork of streets?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 19, 2015 at 15:56 | comment | added | Dylan Thurston | Thanks for the heads up. I was able to locate the image on my computer. | |
| Aug 19, 2015 at 15:55 | history | edited | Dylan Thurston | CC BY-SA 3.0 |
deleted 32 characters in body
|
| Aug 18, 2015 at 11:43 | comment | added | Ilmari Karonen | It looks like ImageShack has decided to delete your image and replace it with an ad banner. If you can, please reupload your image using the upload button in the editor toolbar. | |
| Jan 8, 2011 at 17:30 | vote | accept | Ken Fan | ||
| Jan 8, 2011 at 17:30 | comment | added | Ken Fan | Thanks for including the matrix graphic! I understand now that you're counting physically different path snippets (which includes the information of pairings on the right) without regard to orientation. In retrospect, Christian does seem to have this notion (with pairings on the left), but I was thrown by the first matrix with all zeroes and ones. I think as far as the question I posed here goes, the problem is settled and I think it should be so noted. I wish I could accept both answers. I've marked both up, but will go ahead and accept this one because of the pretty picture... | |
| Jan 8, 2011 at 5:58 | history | edited | Dylan Thurston | CC BY-SA 2.5 |
added 374 characters in body
|
| Jan 8, 2011 at 2:53 | history | edited | Dylan Thurston | CC BY-SA 2.5 |
added 255 characters in body
|
| Jan 3, 2011 at 16:37 | history | answered | Dylan Thurston | CC BY-SA 2.5 |