Covering a crossing supermodular function with graph edges
Statement
Given a crossing supermodular function satisfying , what is the minimum number of edges of an undirected graph G covering p (that is, with the property that holds 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.