1 problem

0 votes0 replies1 view
Polynomial-time MIS conjecture for graphs forbidding independent planar minors
Independent-planar-minor MIS conjecture. For every planar $H$ and every $k$ , MIS is polynomial-time solvable on the class of $kH$ -free graphs.
Conjectureopenmaximum-independent-set parameterized-complexity planar-minorsarXiv posted 2 days ago

Polynomial-time MIS conjecture for graphs forbidding independent planar minors