The USCS edge-removal conjecture for asymptotic non-linear index coding
Statement
Let a USCS graph be a graph whose edges all lie on directed cycles. Suppose that the graph supports a given set of rates for asymptotic non-linear index coding, and let be an edge lying on a single directed cycle, meaning that it completes that cycle and removing it breaks the cycle. USCS edge-removal conjecture. Removing results in a graph that no longer supports the given set of rates. The conjecture proposes a converse-like strengthening of the necessary USCS condition for criticality in asymptotic non-linear index coding. The supplied status evidence indicates that it has been disproved.
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.