ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a maximal planar graph be a planar graph to which no edge can be added while preserving planarity, and let a spanning 2-tree be a spanning subgraph that is a 2-tree. Spanning 2-tree conjecture. Every maximal planar graph with order n≥3n\geq3 contains a spanning 2-tree. This reframes Cai's question about whether every plane triangulation contains a spanning 2-tree; the problem is nontrivial because, unlike spanning trees and spanning 3-trees in planar graphs, the existence of a spanning 2-tree is not automatic. Special cases include 4-connected maximal planar graphs and 3-trees, but the general question remains open in the source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.