Many triangles in \(C_5\)-free graphs

DOI10.1016/J.AAM.2024.102740zbMATH Open1546.05076MaRDI QIDQ6596197

Zequn Lv, Mei Lu, Zhen He

Publication date: 2 September 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

triangles\(F\)-free graphgeneralized Turán numberinduced-\(F\)-free graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Pentagons vs. triangles
• Some sharp results on the generalized Turán numbers
• Generalized Turán problems for even cycles
• Counting copies of a fixed subgraph in \(F\)-free graphs
• A note on the maximum number of triangles in a C₅‐free graph
• Induced Turán Numbers
• A Generalized Turán Problem and its Applications
• A generalized Turán problem in random graphs
• Many H-Copies in Graphs with a Forbidden Tree
• Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Many triangles in \(C_5\)-free graphs

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