Now showing items 1-1 of 1

    • Pure Pairs. IX. Transversal Trees 

      Scott, Alex; Seymour, Paul; Spirkl, Sophie (Society for Industrial and Applied Mathematics, 2024)
      Fix k>0, and let G be a graph, with vertex set partitioned into k subsets ("blocks") of approximately equal size. An induced subgraph of G is "transversal" (with respect to this partition) if it has exactly one vertex in ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages