arXiv (All)
open access
Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor
We show that there is a fixed planar graph $H$, namely the $5 \times 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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- ALMOST PERFECT MATRICES AND GRAPHS#941673
- List coloring $C_3$-free planar graphs with a sparse matching of restricted lists#819736
- List coloring $C_3$-free planar graphs with a sparse matching of restricted lists#809740
- On $k$-limited domination: complexity and Cartesian products#1156397
- On minimal regular graphs with given constraintsm#1041667
Record · ID 998825
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive