Local edge-connectivity augmentation of a hypergraph with fixed rank
Statement
We are given a hypergraph of rank at most (where is fixed, not part of the input) and a symmetric function . Can we find in polynomial time a graph with a minimum number of edges such that for every ?
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.