Proof of `Homomorphism counts into a disjoint union`
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
In the paper
- page 3 of this submission's paper
Description
. The image of a connected graph under a homomorphism is connected, so it lies entirely in or entirely in ; hence the homomorphisms into are the disjoint union of those into and those into .