The cycle of length four is strictly \(F\)-Turán-good

DOI10.1007/s40840-023-01602-2zbMath1527.05052arXiv2208.05386OpenAlexW4388494286MaRDI QIDQ6090832

Doudou Hei, Xin Min Hou

Publication date: 20 November 2023

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

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

zbMATH Keywords

Turán graphTurán-good\(C_4\)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• On the maximum number of five-cycles in a triangle-free graph
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Some sharp results on the generalized Turán numbers
• On Turán-good graphs
• Some results on \(k\)-Turán-good graphs
• Maximizing five-cycles in \(K_r\)-free graphs
• Paths of length three are \(K_{r+1}\)-Turán-good
• Some exact results for generalized Turán problems
• Generalized Turán problems for even cycles
• Some exact results of the generalized Turán numbers for paths
• Flag algebras
• Many \(T\) copies in \(H\)-free graphs
• Efficient testing of large graphs
• Generalized Turán problems for double stars
• Some Stability and Exact Results in Generalized Turán Problems

This page was built for publication: The cycle of length four is strictly \(F\)-Turán-good