The induced -minor-free subgraph conjecture for planar graphs
The induced -minor-free subgraph conjecture for planar graphs
From papers
Let be a planar graph of order . The -minor-free subgraph number is the maximum order of an induced -minor-free subgraph of .
Induced -minor-free subgraph conjecture.
This conjecture is motivated by the corresponding conjecture for induced outerplanar subgraphs and remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Kengo Enami, Naoki Matsumoto and Takamasa Yashima, “Contributions to conjectures on planar graphs: Induced Subgraphs, Treewidth, and Dominating Sets”, arXiv:2506.10471 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.