Generalized regular Turán numbers

Abstract

We combine two generalizations of ordinary Turán problems. Given graphs $H$ and $F$ and a positive integer $n$, we study $rex(n,H,F)$, which is the largest number of copies of $H$ in $F$-free regular $n$-vertex graphs.

arXiv commentSome mistakes are fixed. Particularly, the proof of Proposition 1.4 has been revised and Theorem 1.8 is extended to cover all values of $k$