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

DOI10.1016/J.EJC.2023.103828MaRDI QIDQ6181995zbMATH OpenFDO

Authors Dániel Gerbner, Balázs Patkós, Zsolt Tuza, Máté Vizer

Publication date 23 January 2024

Published in European Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/1912.10287

zbMATH Keywords

3-chromatic graphmaximum number of edges

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Extremal problems in graph theory (05C35)

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,K_{r+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.

Recommendations

• Generalized regular Turán numbers
• Regular Tur\'an numbers
• Regular Turán numbers of complete bipartite graphs
• Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
• Some Stability and Exact Results in Generalized Turán Problems

Cites work

• scientific article; zbMATH DE number 4214034 (Why is no real title available?)
• scientific article; zbMATH DE number 3691361 (Why is no real title available?)
• scientific article; zbMATH DE number 3258067 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.
• On the non-(p-1)-partite K_p-free graphs
• Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
• Singular Ramsey and Turán numbers

Cited in

(2)

• Generalized regular Turán numbers
• On saturation problems for matchings with regularity constraints

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)