New blog post: Layered pathwidth and its obstacles
I describe my new preprint with Dujmović, Joret, Morin, and Wood proving that a minor-closed graph family has bounded local pathwidth, linear local pathwidth, or bounded layered pathwidth iff it excludes an apex-tree, and compare analogous results in which the structure of a forbidden minor tells you about the structure of the graphs in a minor-closed family.
A Mastodon instance for maths people. The kind of people who make \(\pi z^2 \times a\) jokes.
\) for inline LaTeX, and
\] for display mode.