Hypergraph matching conjecture for edge-modification complexity
Statement
Let , let be a -uniform hypergraph, and let be an input -uniform hypergraph. Write for the minimum number of edges that must be removed from to make it -free. A matching is a hypergraph whose edges are pairwise vertex-disjoint. Hypergraph matching conjecture. For every and every -graph , computing is polynomial-time solvable if is a matching and NP-hard otherwise.
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.