The induced K4K_4-minor-free subgraph conjecture for planar graphs

From papers

Let GG be a planar graph of order nn. The K4K_4-minor-free subgraph number sK4(G)s_{K_4}(G) is the maximum order of an induced K4K_4-minor-free subgraph of GG.

Induced K4K_4-minor-free subgraph conjecture.

sK4(G)2n3.s_{K_4}(G)\ge\frac{2n}{3}.

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

No solutions have been posted yet.