Timeline for Concepts in topology successfully transferred to graph theory and combinatorics with non-trivial applications?
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 12, 2019 at 21:37 | vote | accept | Turbo | ||
| Nov 17, 2017 at 19:53 | comment | added | Sam Hopkins | Not clear yet if this is successful, but Kronheimer and Mrowka have an ambitious program to understand graph colorings (in particular, the four-color theorem) in terms of a certain instanton Floer homology for graphs: see arxiv.org/abs/1508.07205, arxiv.org/abs/1508.07207, arxiv.org/abs/1710.05002. | |
| Nov 17, 2017 at 19:44 | answer | added | Tsemo Aristide | timeline score: 2 | |
| Nov 17, 2017 at 9:39 | answer | added | Dima Pasechnik | timeline score: 8 | |
| Nov 17, 2017 at 2:07 | answer | added | Max Alekseyev | timeline score: 3 | |
| Nov 16, 2017 at 16:20 | answer | added | Timothy Chow | timeline score: 11 | |
| Nov 16, 2017 at 14:20 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
| Nov 16, 2017 at 14:09 | answer | added | Joseph O'Rourke | timeline score: 10 | |
| Nov 16, 2017 at 10:33 | answer | added | Tsemo Aristide | timeline score: 8 | |
| Nov 16, 2017 at 9:17 | answer | added | Peter Heinig | timeline score: 13 | |
| Nov 16, 2017 at 8:33 | answer | added | Dominic van der Zypen | timeline score: 6 | |
| Nov 16, 2017 at 8:14 | history | edited | Turbo | CC BY-SA 3.0 |
added 12 characters in body; edited title
|
| Nov 16, 2017 at 8:05 | history | edited | Martin Sleziak | CC BY-SA 3.0 |
typo in the title
|
| Nov 16, 2017 at 8:00 | history | asked | Turbo | CC BY-SA 3.0 |