Exact generalized Turán number for \(K_3\) versus suspension of \(P_4\)

DOI10.1016/j.disc.2023.113866arXiv2307.04369MaRDI QIDQ6197734

Sayan Mukherjee

Publication date: 19 February 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

generalized Turán problemcomputer programmingsuspension of a graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Cites Work

• Pentagons vs. triangles
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Some sharp results on the generalized Turán numbers
• Triangles in graphs without bipartite suspensions
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• A note on the maximum number of triangles in a C₅‐free graph
• A Note on the Number of Triangles in Graphs Without the Suspension of a Path on Four Vertices
• Many \(T\) copies in \(H\)-free graphs
• Triangles in C5‐free graphs and hypergraphs of girth six
• Unnamed Item

This page was built for publication: Exact generalized Turán number for \(K_3\) versus suspension of \(P_4\)