On graphs decomposable into induced matchings of linear sizes
On graphs decomposable into induced matchings of linear sizes
We call a graph G an ( r , t ) -Ruzsa–Szemerédi graph if its edge set can be partitioned into t edge-disjoint induced matchings, each of size r. These graphs were introduced in 1978 and have been extensively studied since then. In this paper, we consider the case when …