Timeline for Generalized digraph homomorphisms and graph cores
Current License: CC BY-SA 4.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 30, 2018 at 16:19 | vote | accept | Ethan Splaver | ||
Dec 30, 2018 at 15:24 | answer | added | Benjamin Steinberg | timeline score: 3 | |
Dec 30, 2018 at 11:10 | comment | added | Ethan Splaver | Can you elaborate a bit more? I'd really appreciate it. | |
Dec 30, 2018 at 10:55 | comment | added | Ilya Bogdanov | Say two vertices are equivalent iff their out-edges go to the same set of vertices, the same for in-edges. The equivalence classes are the vertices of the unique maximal reduction. | |
Dec 30, 2018 at 10:07 | history | asked | Ethan Splaver | CC BY-SA 4.0 |