1 problem

Let an $(r,t)$-Ruzsa–Szemerédi graph be a graph whose edges can be partitioned into $t$ pairwise disjoint induced matchings, each of size $r$. Here $n$ is the number of vertices, a…