Timeline for BEST theorem for Eulerian paths with open ends
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 18, 2017 at 14:06 | comment | added | Peter Heinig | Already van Aardenne-Ehrenfest and de Bruijn in page 207 of their original paper are very explicit about allowing quivers (without using that term, of course). Also, a wonderfully detailed exposition of Paul Klingsberg seems useful to point out here. | |
| Aug 18, 2017 at 14:05 | comment | added | Peter Heinig | Re the rendition of the original BEST theorem (I am not speaking about the proposed variant here), in particular re "in a balaced digraph" in the OP: to me it seems an underappreciated fact(or at least, drowned-in-the-usual-terminological-confusion-about-what-"digraph"-means-precisely fact) that the BEST theorem is true for every degree-balanced finite quiver. That is, multiple arcs and loops are allowed. | |
| Jul 6, 2011 at 8:16 | vote | accept | tomate | ||
| Jul 5, 2011 at 22:02 | answer | added | Gerhard Paseman | timeline score: 1 | |
| Jul 1, 2011 at 20:21 | comment | added | Gerhard Paseman | Try drawing a line segment between the two unbalanced vertices, and then use the previous result. Gerhard "The Shortest Distance Between Results..." Paseman, 2011.07.01 | |
| Jul 1, 2011 at 16:31 | history | asked | tomate | CC BY-SA 3.0 |