Timeline for Does every finite simple graph embed into the "fixed point graph"?
Current License: CC BY-SA 4.0
12 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 18, 2020 at 3:48 | vote | accept | Dominic van der Zypen | ||
Dec 17, 2020 at 23:30 | answer | added | Corey Bacal Switzer | timeline score: 2 | |
Dec 17, 2020 at 21:19 | comment | added | LSpice | @Wojowu, I got it. | |
Dec 17, 2020 at 21:19 | history | edited | LSpice | CC BY-SA 4.0 |
Link to comment; changed post title to reflect changed question; proofreading
|
Dec 17, 2020 at 21:18 | comment | added | Wojowu | You forgot to update the title | |
Dec 17, 2020 at 20:33 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
added 272 characters in body; edited tags
|
Dec 17, 2020 at 20:27 | comment | added | Dominic van der Zypen | Will include the remark of @wojowu in the question | |
Dec 17, 2020 at 20:27 | history | undeleted | Dominic van der Zypen | ||
Dec 17, 2020 at 19:12 | history | deleted | Dominic van der Zypen | via Vote | |
Dec 17, 2020 at 19:10 | comment | added | Dominic van der Zypen | Thanks yes, I will remove the question | |
Dec 17, 2020 at 14:39 | comment | added | Wojowu | No, since the graph is symmetric: if $(f,g)\in E$, then $(g,f)\in E$. Indeed, if $n$ is a fixed point of $g\circ f$, then $f(n)$ is a fixed point of $f\circ g$. So asymmetric digraphs cannot be induced subgraphs of your graph. | |
Dec 17, 2020 at 11:31 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |