ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A\boldsymbol A be an instance of the paper's network-coding problem with rr receivers, where each receiver wants rr data packets and every pair of receivers wants at most one data packet in common. Perfect network coding solution conjecture. The instance A\boldsymbol A has a perfect network-coding solution Sp\mathcal S_p. The claim is presented as the corresponding network-coding conjecture arising from the hypergraph-coloring reduction; the supplied source gives no resolution status, so it is recorded as open.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.