Polynomial-time MIS conjecture for graphs forbidding independent planar minors
Statement
Let be a planar graph and let be a positive integer. A graph is -free if it contains no pairwise non-adjacent independent -minor models. MIS denotes the Maximum Independent Set problem.
Independent-planar-minor MIS conjecture. For every planar and every , MIS is polynomial-time solvable on the class of -free graphs.
The paper proves an -time algorithm for this problem, so the conjecture asks whether the quasi-polynomial bound can always be improved to polynomial time. It remains open in the -free case.
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.