A note on the maximum number of triangles in a C5‐free graph

DOI10.1002/JGT.22390zbMath1407.05133OpenAlexW2892928329MaRDI QIDQ4629994

Abhishek Methuku, Nika Salia, Beka Ergemlidze, Ervin Gyoeri

Publication date: 28 March 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22390

zbMATH Keywords

extremal graphstriangles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (21)

Subgraph densities in a surface ⋮ Tree densities in sparse graph classes ⋮ Some exact results for generalized Turán problems ⋮ Multicolor Turán numbers ⋮ On generalized Turán number of two disjoint cliques ⋮ Some extremal results on hypergraph Turán problems ⋮ Complete subgraphs in connected graphs and its application to spectral moment ⋮ The maximum number of paths of length four in a planar graph ⋮ Extremal problems of double stars ⋮ Triangles in C5‐free graphs and hypergraphs of girth six ⋮ The maximum number of paths of length three in a planar graph ⋮ Stability version of Dirac's theorem and its applications for generalized Turán problems ⋮ Maximum cliques in a graph without disjoint given subgraph ⋮ Exact generalized Turán number for \(K_3\) versus suspension of \(P_4\) ⋮ Generalized Turán problems for even cycles ⋮ Triangles in graphs without bipartite suspensions ⋮ Some exact results of the generalized Turán numbers for paths ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ Extensions of the Erdős–Gallai theorem and Luo’s theorem ⋮ Generalized Turán densities in the hypercube ⋮ The regularity method for graphs with few 4‐cycles

This page was built for publication: A note on the maximum number of triangles in a C₅‐free graph