On the number of \(C_ 5's\) in a triangle-free graph

DOI10.1007/BF02122689zbMath0679.05042OpenAlexW2148929061MaRDI QIDQ1124605

Ervin Gyoeri

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02122689

zbMATH Keywords

graphforbidden 3-cyclesnumber of 5-cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (18)

Paths of length three are \(K_{r+1}\)-Turán-good ⋮ The Maximum Number of Triangles in C_2k+1-Free Graphs ⋮ Some exact results for generalized Turán problems ⋮ On supersaturation and stability for generalized Turán problems ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ On the Number of Cycles in a Graph with Restricted Cycle Lengths ⋮ Strong forms of stability from flag algebra calculations ⋮ On the maximal number of certain subgraphs in \(K_ r\)-free graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the density of triangles and squares in regular finite and unimodular random graphs ⋮ Pentagons vs. triangles ⋮ On 3-uniform hypergraphs without a cycle of a given length ⋮ On the maximum number of five-cycles in a triangle-free graph ⋮ On the inducibility of cycles ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ Generalized outerplanar Turán number of short paths ⋮ Generalized Turán densities in the hypercube

This page was built for publication: On the number of \(C_ 5's\) in a triangle-free graph