Now showing items 1-3 of 3

    • Concatenating Bipartite Graphs 

      Chudnovsky, Maria; Hompe, Patrick; Scott, Alex; Seymour, Paul; Spirkl, Sophie (The Electronic Journal of Combinatorics, 2022)
      Let x, y E (0, 1], and let A, B, C be disjoint nonempty stable subsets of a graph G, where every vertex in A has at least x |B| neighbors in B, and every vertex in B has at least y|C| neighbors in C, and there are no edges ...
    • Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree 

      Scott, Alex; Seymour, Paul; Spirkl, Sophie (Wiley, 2022-09-07)
      Let H be a tree. It was proved by Rödl that graphs that do not contain H as an induced subgraph, and do not contain the complete bipartite graph Kt,t as a subgraph, have bounded chromatic number. Kierstead and Penrice ...
    • Student Success in Co-operative Education: An Analysis of Job Postings and Performance Evaluations 

      Salm, Veronica (University of Waterloo, 2023-05-26)
      Co-operative education (co-op) programs combine coursework and work internships and have become popular worldwide. In this analysis, we use two separate co-op datasets to understand employer expectations and factors that ...

      UWSpace

      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