Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor
Édouard Bonnet, Yeonsu Chang
Abstract
We show that there is a fixed planar graph H, namely the 5 × 5 grid, such that Max Independent Set remains NP-hard in H-induced-minor-free graphs. This refutes the Dallard--Milanič--Štorgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.
Create a lesson
Related papers
A Dichotomy for Boolean Complex Holant Problems with Conjugate-Closed Signature Sets
Jincheng Guan, Shuai Shao, Zhuxiao Tang
Deterministic NC Quadratic Root Counting in Characteristic Two
Sanyam Agarwal, Gorav Jindal
The Information Complexity of Decision Trees
Avantika Agarwal, Shalev Ben-David, Eric Blais
Topology inside NC1
Eric Allender, Samir Datta, Arsenii Karnaukhov et al.
The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of SL(2,C)
Yuan Huang, Zhiguo Fu
On the Limits of Quantum Multiparty Simultaneous Communication
Pedro Montealegre, Ivan Rapaport, Jorge Valenzuela