The polynomial-time threshold conjecture for minimum ℓ-degree perfect matching
Statement
Let , let , and let . Define to be the problem of deciding whether a -graph on vertices with minimum -degree at least has a perfect matching. The polynomial-time threshold conjecture.
This is the algorithmic counterpart to the space-barrier threshold: the source notes NP-completeness below this threshold, while the asserted polynomial-time result remains conjectural.
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.