English

Generalized regular Tur\'an numbers

Combinatorics 2023-11-06 v1

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.

Keywords

Cite

@article{arxiv.2311.01579,
  title  = {Generalized regular Tur\'an numbers},
  author = {Dániel Gerbner and Hilal Hama Karim},
  journal= {arXiv preprint arXiv:2311.01579},
  year   = {2023}
}

Comments

13 pages

R2 v1 2026-06-28T13:10:07.482Z