Apex-outerplanar minor conjecture
Apex-outerplanar minor conjecture
Let be an outerplanar graph, and let denote the graph obtained from by adding an apex vertex adjacent to every vertex of . Apex-outerplanar minor conjecture. Every graph with minimum degree at least contains as a minor. The theorem in the paper proves this for a large class of outerplanar graphs, while the full conjecture 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
Sign in to submit a solution.
No solutions have been posted yet.