Now showing items 1-1 of 1

    • Ramsey-nice families of graphs 

      Aharoni, Ron; Alon, Noga; Amir, Michal; Haxell, Penny; Hefetz, Dan; Jiang, Zilin; Kronenberg, Gal; Naor, Alon (Elsevier, 2018-08)
      For a finite family $\cF$ of fixed graphs let $R_k(\cF)$ be the smallest integer $n$ for which every $k$-coloring of the edges of the complete graph $K_n$ yields a monochromatic copy of some $F\in\cF$. We say that $\cF$ ...

      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