Induced maximal outerplane subgraph conjecture

At least 8 years old · documented by

Let GG be a plane graph of sufficiently large order nn. The outerplane subgraph number so′(G)s_{o'}(G) is the maximum order of an induced outerplane subgraph of GG.

Induced maximal outerplane subgraph conjecture.

so′(G)≥5n8.s_{o'}(G)\ge\frac{5n}{8}.

The construction in the paper gives examples with an induced maximal outerplane subgraph of order at most 5∣V(G)∣/8+15|V(G)|/8+1; the supplied text does not state a resolution of this conjecture.

References

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).

Additional references

2 papers in this index state this conjecture (2017–2025). The statement above is taken from the most recent of them; the others are arXiv:1711.00212.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.