Proof of `Homomorphism counts into a full complement`
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.
Description
. A map is a homomorphism into the full complement exactly when it avoids, for every edge of , the event that its endpoints are sent to an adjacent pair; inclusion–exclusion over those events counts the maps avoiding all of them, and the maps satisfying the events of a set of edges are the homomorphisms out of the spanning subgraph with edge set .