Generalized regular Tur\'an numbers

Abstract

We combine two generalizations of ordinary Tur\'an problems. Given graphs HH and FF and a positive integer nn, we study rex(n,H,F)rex(n, H, F ), which is the largest number of copies of HH in FF-free regular nn-vertex graphs.Comment: 13 page

    Similar works

    Full text

    thumbnail-image

    Available Versions