The far-apart planar Erdős–Pósa conjecture
Let be a planar graph. An minor-model is a model of in , and minor-models are pairwise distance at least when every two distinct models are at that distance or farther. Then there is a function and a constant such that for every graph , if does not contain disjoint minor-models that have pairwise distance at least from each other, then there is a set of at most vertices of such that contains no minor. Far-apart planar Erdős–Pósa conjecture.
This conjecturally strengthens the known far-apart-cycle result to arbitrary planar minor-models. The paper presents it after contrasting it with the failure of the general 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
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.