Generalized regular Tur\'an numbers
Abstract
We combine two generalizations of ordinary Tur\'an 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.