1 paper
Ge Lin, Changjiang Bu
The s-blowup of a graph (s≥2) is the 2s-uniform hypergraph obtained by replacing each vertex with a set of size s and preserving the adjacency relation. In this paper, w…