The two-copy coarse Erdős–Pósa conjecture for planar graphs
Let be a planar graph. A -fat minor-model of is a -fat model of , and denotes the ball of radius around in . Then there exists a constant such that for every graph , if does not contain two -fat minor-models of at distance at least from each other, then there is a set of at most vertices of such that meets all -fat minor-models in . Two-copy coarse Erdős–Pósa conjecture.
The paper states this as the unresolved case of two copies after showing that planar graphs do not generally have the coarse Erdős–Pósa property.
References
- Sandra Albrechtsen and James Davies, “Counterexample to the conjectured coarse grid theorem”, arXiv:2508.15342 (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.