wiki_research

personal research wiki
git clone https://a3nm.net/git/wiki_research/
Log | Files | Refs

forest_minor_theorem (215B)

      1 # Forest minor theorem
      2 
      3 proved by [Robertson_and_Seymour]: the [H_minor_free] [graphs] have bounded [pathwidth] iff H is a [forest]
      4 
      5 Discussed in [bonnet2025excluding], see also [kuhn2025computing]
      6 
      7 Up: [pathwidth]