1 problem

0 votes0 replies1 view
Dvořák et al.'s exponential bound conjecture for treedepth obstructions
An elimination forest $F$ for a graph $G=(V,E)$ is a rooted forest on $V$ such that every edge of $G$ joins an ancestor and a descendant in $F$ . The treedepth $\text{td}(G)$ is the…
Conjectureopengraph-minors graph-obstructions treedeptharXiv posted 2 days ago

Dvořák et al.'s exponential bound conjecture for treedepth obstructions