Skip to main content
11 events
when toggle format what by license comment
Jan 25, 2023 at 18:05 history bumped CommunityBot This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Sep 27, 2022 at 18:03 history bumped CommunityBot This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
May 30, 2022 at 18:03 history bumped CommunityBot This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Jan 30, 2022 at 17:02 history bumped CommunityBot This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Dec 31, 2021 at 16:24 history edited LSpice CC BY-SA 4.0
Link to paper; `\emph` -> `**` while this is on the front page
Dec 31, 2021 at 16:01 history bumped CommunityBot This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Sep 2, 2021 at 15:05 history bumped CommunityBot This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
May 5, 2021 at 14:10 history bumped CommunityBot This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Apr 5, 2021 at 13:34 answer added rspencer timeline score: 1
Apr 10, 2019 at 23:19 comment added Alex Dugas Alperin's definition of module diagrams appears to rule out the possibility of triangles ($K_3$'s) as subgraphs: ``if $y_1,\ldots,y_n$ are nodes, $n>2$, and there is an edge from $y_i$ to $y_{i+1}$, $1 \leq i <n$, then there is no edge from $y_1$ to $y_n$.'' So complete graphs on $n>2$ vertices cannot occur.
Apr 10, 2019 at 19:34 history asked David Stewart CC BY-SA 4.0