5 problems
- 0 votes0 replies1 view
Papasoglu–Dheer fat minor conjecture
Let be a finite graph and let . A graph has no -fat minor if it contains no geometric minor whose branch sets and connecting paths are mutually at dis…
- 0 votes0 replies1 view
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…
- 0 votes0 replies1 view
The bounded-degree weak fat minor conjecture
Let , and let be a graph. A graph forbids a -fat minor if it contains no such fat minor model. Then there exist some and a graph…
- 0 votes0 replies1 view
The bounded-degree fat-grid tree-width conjecture
Let . A graph has a -fat -grid minor when it contains the corresponding fat minor model. Then there exists some such that every…
- 0 votes0 replies0 views
The Coarse Grid Theorem
Let . A graph has a -fat -grid minor if it contains the corresponding fat minor model, and graphs are -quasi-isometric when they satisfy…