Graph Entropy Characterization of Relay-Assisted Zero-Error Source Coding with Side Information

A sender knows X and a receiver knows a correlated Z and would like to learn X, without error. The sender can communicate with the receiver only via a relay, that knows a correlated Y. We study the expected number of bits per instance that need to be sent to and from the relay to that end, in the limit of multiple instances.