Timeline for Seven Bridges of Königsberg for hypergraphs
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 22, 2021 at 16:40 | comment | added | Sam Hopkins | But for something very classic: the "Happy Ending Problem" (en.wikipedia.org/wiki/Happy_ending_problem) can be resolved using hypergraph Ramsey numbers (for specifically 3-uniform hypergraphs). | |
| Mar 22, 2021 at 16:38 | comment | added | Sam Hopkins | Hypergraphs are extremely general objects (sets of subsets, basically), and somehow slightly less "visual" than graphs are, so it's hard to give something that feels very concrete. | |
| Mar 22, 2021 at 14:41 | answer | added | Matthieu Latapy | timeline score: 4 | |
| Mar 22, 2021 at 14:11 | review | First posts | |||
| Mar 22, 2021 at 15:11 | |||||
| Mar 22, 2021 at 14:07 | history | asked | sensei | CC BY-SA 4.0 |