1 problem

0 votes0 replies0 views
Gartland's breakability conjecture for wall-subdivision-free graphs
Gartland's conjecture. For every positive integer $t$ , there is an integer $d=d(t)$ such that every $\mathcal{L}_t$ -free graph $G$ with no induced subgraph isomorphic to a subdivis…
Conjectureopengraph-separators tree-independence wall-graphsarXiv posted 2 days ago

Gartland's breakability conjecture for wall-subdivision-free graphs