Timeline for Representing graphs as induced subgraphs of $\text{Hom}(H,K)$
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 10, 2019 at 4:05 | comment | added | Dominic van der Zypen | Thanks for your comments! If one of you can post their comment as an answer, we can close this thread | |
| Dec 9, 2019 at 17:20 | comment | added | Gabe Conant | I assume the requirement $|V(H)|>1$ is to rule out choosing $H=K_1$ and $K=G$. But instead one could let $H=K_2$ and $K$ be the join $G+G$ of two disjoint copies of $G$. | |
| Dec 9, 2019 at 15:57 | comment | added | Gerhard Paseman | Let H be a Cartesian product of G and K. I would think G would be a subgraph of the homomorphism graph. Gerhard "Turn Each Map Into Vertex" Paseman, 2019.12.09. | |
| Dec 9, 2019 at 9:37 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |