ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a planar graph, and let an HH-expansion denote a subdivision of HH. The edge-Erdős–Pósa property concerns whether, for every graph in the family of HH-expansions, either there are many pairwise edge-disjoint copies or a bounded edge set meets every copy.

Large-expansion conjecture. There is an integer cc such that for every planar graph HH of treewidth (or even pathwidth) at least cc, the family of HH-expansions does not have the edge-Erdős–Pósa property.

The paper proves this failure for subdivisions of all subcubic trees of sufficiently large pathwidth and expects the analogous result for expansions of sufficiently large grids. The conjecture extends these results to all planar graphs of sufficiently large treewidth, or even pathwidth.

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.