Some exact results for regular Turán problems for all large orders

From MaRDI portal
Publication:6181995




Abstract: As a variant of the famous Tur'an problem, we study mathrmrex(n,F), the maximum number of edges that an n-vertex regular graph can have without containing a copy of F. We determine mathrmrex(n,Kr+1) for all pairs of integers r and large enough n. For every tree T, we determine mathrmrex(n,T) for every n large enough.









This page was built for publication: Some exact results for regular Turán problems for all large orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181995)