Timeline for "Homomorphism fingerprint" for graphs
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 5, 2014 at 9:35 | vote | accept | Dominic van der Zypen | ||
| Dec 5, 2014 at 9:20 | answer | added | Eric Wofsey | timeline score: 8 | |
| Dec 5, 2014 at 9:02 | answer | added | Qiaochu Yuan | timeline score: 3 | |
| Dec 3, 2014 at 6:11 | comment | added | Qiaochu Yuan | If you can construct a graph $G$ such that $|\text{Hom}(X, G)|$ is always either empty or infinite, then I think you can take $H = G \times G$, and for most $G$ this should be a counterexample. (I'm not sure which graph product you need for the universal property in this setting.) | |
| Dec 2, 2014 at 14:18 | review | Close votes | |||
| Dec 2, 2014 at 17:16 | |||||
| Dec 2, 2014 at 13:50 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |