Mathematics > Combinatorics
arXiv:2311.01579 (math)
[Submitted on 2 Nov 2023 (v1), last revised 28 Aug 2026 (this version, v2)]
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.
| Comments: | Some 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$ |
| Subjects: | Combinatorics (math.CO) |
| Cite as: | arXiv:2311.01579 [math.CO] |
| (or arXiv:2311.01579v2 [math.CO] for this version) | |
| https://doi.org/10.48550/arXiv.2311.01579 arXiv-issued DOI via DataCite |
|
| Journal reference: | Dániel Gerbner and Hilal Hama Karim. Generalized regular Turán numbers, Australasian Journal of Combinatorics, 90(3), 326-340, 2024 |
Submission history
From: Hilal Hama Karim [view email]
[v1]
Thu, 2 Nov 2023 20:17:03 UTC (15 KB)
[v2]
Fri, 28 Aug 2026 12:52:29 UTC (20 KB)
Current browse context:
math.CO
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.