Rank-respecting augmentation of hypergraphs with negamodular constraints
Statement
Given a crossing negamodular function such that for every and a hypergraph , find a hypergraph of minimum total size such that holds for every and the rank of does not exceed the rank of .
Record
- Source
- Added
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.