ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a kk-graph on nn vertices, and let δℓ(H)\delta_\ell(H) be its minimum ℓ\ell-degree. Define PM(k,ℓ,δ){\bf PM}(k,\ell,\delta) to be the decision problem of determining whether a kk-graph on nn vertices with minimum ℓ\ell-degree at least δ(nk−ℓ)\delta\binom{n}{k-\ell} has a perfect matching; write PM(k,δ):=PM(k,k−1,δ){\bf PM}(k,\delta):={\bf PM}(k,k-1,\delta). A problem is in PP if it can be solved in polynomial time.

Keevash–Knox–Mycroft conjecture. The decision problem

PM(k,ℓ,δ){\bf PM}(k,\ell,\delta)

is in PP for every δ>1−(1−1/k)k−ℓ\delta>1-(1-1/k)^{k-\ell}.

This conjecture concerns the transition from NP-completeness below the space-barrier threshold to polynomial-time solvability above it. The paper states that the conjecture was verified in a range of cases using its main theorem, but does not establish it in full generality.

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.