ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let an ε\varepsilon-thin tree in a connected graph GG be a spanning tree TT such that, for every cut-set S⊆E(G)S\subseteq E(G),

∣E(T)∩S∣∣S∣≤ε.\frac{|E(T)\cap S|}{|S|}\leq\varepsilon.

Thin-tree conjecture for 5-edge-connected planar graphs. There exists an ε∈(0,1)\varepsilon\in(0,1) such that every 55-edge-connected planar graph admits two edge-disjoint ε\varepsilon-thin trees. This is presented as a weaker conjecture implied by a question from the cited work on bounded-diameter forest decompositions; the source discusses a partial resolution of that related question, but does not state that this thin-tree conjecture is solved.

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.