Gerbner, Dániel and Patkós, Balázs and Tuza, Zsolt and Vizer, Máté (2024) Some exact results for regular Turán problems for all large orders. EUROPEAN JOURNAL OF COMBINATORICS, 117. ISSN 0195-6698
|
Text
1-s2.0-S0195669823001464-main.pdf - Published Version Available under License Creative Commons Attribution. Download (363kB) | Preview |
Official URL: https://doi.org/10.1016/j.ejc.2023.103828
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.
Item Type: | Article |
---|---|
Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
SWORD Depositor: | MTMT SWORD |
Depositing User: | MTMT SWORD |
Date Deposited: | 28 Mar 2024 10:04 |
Last Modified: | 28 Mar 2024 10:04 |
URI: | https://real.mtak.hu/id/eprint/191160 |
Actions (login required)
![]() |
Edit Item |