Some exact results for regular Turán problems for all large orders

Abstract

As a variant of the famous Turán problem, we study rex(n,F), the maximum number of edges that an n-vertex regular graph can have without containing a copy of F. We determine rex(n,Kr+1) for all pairs of integers r and large enough n. For every tree T, we determine rex(n,T) for every n large enough.