ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥3k\geq 3, let FF be a kk-uniform hypergraph, and let GG be an input kk-uniform hypergraph. Write remF(G)\mathrm{rem}_F(G) for the minimum number of edges that must be removed from GG to make it FF-free. A matching is a hypergraph whose edges are pairwise vertex-disjoint. Hypergraph matching conjecture. For every k≥3k\geq 3 and every kk-graph FF, computing remF(G)\mathrm{rem}_F(G) is polynomial-time solvable if FF 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.