Timeline for Issue UPDATE: in graph theory, different definitions of edge crossing numbers - impact on applications?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 27, 2020 at 4:59 | history | bounty awarded | user161819 | ||
| Aug 3, 2020 at 18:25 | comment | added | Claus | @TerryTao Terry you are very right. Huge difference between the Wilhelm Ackermann bound that you mention and the Eyal Ackerman bound I am quoting here! Good to make the distinction. | |
| Aug 3, 2020 at 17:37 | comment | added | Terry Tao | The term "Ackermann bound" generally refers to a bound of a type far, far worse than the one given here: en.wikipedia.org/wiki/Ackermann_function | |
| Jul 30, 2020 at 16:33 | comment | added | user161819 | One good thing, my prototype for updated torus algorithm: tested on on first 2 graphs from my test set, and went ok | |
| Jul 30, 2020 at 16:28 | comment | added | user161819 | Thanks for your comment!! Much appreciated. And thanks again for your help. I'm very interested in this Ackermann bound, will take a look at it | |
| Jul 30, 2020 at 15:37 | history | answered | Claus | CC BY-SA 4.0 |