Timeline for Characterization of edge posets
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 15, 2023 at 13:25 | answer | added | xuexing lu | timeline score: 1 | |
| May 15, 2023 at 8:33 | history | edited | xuexing lu | CC BY-SA 4.0 |
added 596 characters in body
|
| May 15, 2023 at 8:25 | history | edited | xuexing lu | CC BY-SA 4.0 |
added 596 characters in body
|
| May 15, 2023 at 8:17 | comment | added | xuexing lu | @Matthieu Latapy Yes, the reachable order of vertices is exactly the transitive closure of the adjacency relation of a DGA. But my question is about the reachable order of edges, not of vertices. | |
| May 15, 2023 at 8:14 | comment | added | bof | @MatthieuLatapy No. The elements of the "edge poset" are the edges, not the vertices. For instance, the $4$-element poset whose Hasse diagram looks like the letter N can not be represented as an edge poset. | |
| May 15, 2023 at 8:07 | comment | added | Matthieu Latapy | Isn't this the transitive closure of the DAG? en.wikipedia.org/wiki/Transitive_closure | |
| S May 15, 2023 at 7:35 | review | First questions | |||
| May 15, 2023 at 7:37 | |||||
| S May 15, 2023 at 7:35 | history | asked | xuexing lu | CC BY-SA 4.0 |