Now showing items 1-2 of 2

    • Pure pairs. I. Trees and linear anticomplete pairs 

      Chudnovsky, Maria; Scott, Alex; Seymour, Paul; Spirkl, Sophie (Elsevier, 2020-12-02)
      The Erdős-Hajnal conjecture asserts that for every graph H there is a constant c > 0 such that every graph G that does not contain H as an induced subgraph has a clique or stable set of cardinality at least |G|c. In this ...
    • Towards Erdős-Hajnal for Graphs with No 5-Hole 

      Chudnovsky, Maria; Fox, Jacob; Scott, Alex; Seymour, Paul; Spirkl, Sophie (Springer Nature, 2019-11-01)
      The Erdős-Hajnal conjecture says that for every graph H there exists c > 0 such that max(α(G), w(G)) ≥ nc for every H-free graph G with n vertices, and this is still open when H = C5. Until now the best bound known on ...

      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