Surjective homomorphism swapping conjecture for simple graphs
Statement
Let be a simple graph. For graphs and , let be the set of graph homomorphisms whose vertex maps are surjective, and write .
Surjective homomorphism swapping conjecture. For every positive integer ,
This is presented as a coefficientwise strengthening of the comparison between and , and the source notes that it would imply the conjecture that is strongly GT. The resolution status is not specified.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.