Maximizing subgraph counts in regular graphs

Gabor Lippner, Arturo Ortiz San Miguel

Given a graph $H$, we investigate the $d$-regular graphs $G$ with the highest $H$-density. We reframe the problem as a continuous optimization problem on the eigenvalues of $G$ by…