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

DOI10.1016/j.ejc.2023.103828arXiv1912.10287MaRDI QIDQ6181995

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

Publication date: 23 January 2024

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

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

zbMATH Keywords

3-chromatic graphmaximum number of edges

Mathematics Subject Classification ID

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

Cites Work

• Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.
• On the non-(p-1)-partite K_{p}-free graphs
• Singular Ramsey and Turán numbers
• Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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