Diwan's subdivision conjecture for planar maximal 3-degenerate graphs

Let HH be a planar maximal 3-degenerate graph. A subdivision of HH is a graph obtained by replacing edges by internally vertex-disjoint paths. Diwan's conjecture. Every graph with minimum degree at least V(H)1|V(H)|-1 contains a subdivision of HH. The conjecture would imply the proposed apex-outerplanar minor conjecture; it remains open.

Sources & referencesView supporting material

Primary source

Chun-Hung Liu and Youngho Yoo, “Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs”, arXiv:2403.11470 (2026).

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.