Many triangles in C₅-free graphs

DOI10.1016/J.AAM.2024.102740MaRDI QIDQ6596197zbMATH OpenFDO

Authors Zequn Lv, Zhen He, Mei Lu

Publication date 2 September 2024

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

Full work available at URL https://doi.org/10.1016/J.AAM.2024.102740

zbMATH Keywords

\(F\)-free graphgeneralized Turán numberinduced-\(F\)-free graphtriangles

Mathematics Subject Classification ID

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

Recommendations

• A note on the maximum number of triangles in a C₅-free graph
• A note on the maximum number of triangles in a C₅‐free graph
• Triangles in C5‐free graphs and hypergraphs of girth six
• Pentagons in triangle-free graphs
• On the maximum number of five-cycles in a triangle-free graph

Cites work

• A generalized Turán problem and its applications
• A generalized Turán problem in random graphs
• A Holder Type Inequality for Symmetric Matrices with Nonnegative Entries
• A note on the maximum number of triangles in a C₅‐free graph
• Counting copies of a fixed subgraph in F-free graphs
• Generalized Turán problems for even cycles
• scientific article; zbMATH DE number 970802 (Why is no real title available?)
• Induced Turán numbers
• Many \(T\) copies in \(H\)-free graphs
• Many H-copies in graphs with a forbidden tree
• Pentagons vs. triangles
• Some sharp results on the generalized Turán numbers
• Turán number of an induced complete bipartite graph plus an odd cycle

Cited in

(1)

• Triangles in C5‐free graphs and hypergraphs of girth six

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)