The Maximum Number of Triangles in C2k+1-Free Graphs

DOI10.1017/S0963548311000629zbMath1238.05145OpenAlexW2066118197MaRDI QIDQ2883861

Hao Li, Ervin Gyoeri

Publication date: 14 May 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548311000629

Mathematics Subject Classification ID

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

Related Items (36)

Degenerate Turán problems for hereditary properties ⋮ Some exact results for generalized Turán problems ⋮ Generalized rainbow Turán problems ⋮ The Generalized Rainbow Turán Problem for Cycles ⋮ A note on the Tur\'an number of a Berge odd cycle ⋮ The maximum number of paths of length four in a planar graph ⋮ Generalized rainbow Turán numbers of odd cycles ⋮ Some extremal results on complete degenerate hypergraphs ⋮ Planar polynomials and an extremal problem of Fischer and Matoušek ⋮ The maximum number of cliques in graphs without long cycles ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ Stability version of Dirac's theorem and its applications for generalized Turán problems ⋮ Turán problems for \(k\)-geodetic digraphs ⋮ Exact generalized Turán number for \(K_3\) versus suspension of \(P_4\) ⋮ Local-vs-global combinatorics ⋮ Generalized Turán problems for even cycles ⋮ Triangles in graphs without bipartite suspensions ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Maximising the number of cycles in graphs with forbidden subgraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Induced Turán Numbers ⋮ On 3-uniform hypergraphs without a cycle of a given length ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ Some sharp results on the generalized Turán numbers ⋮ On Turán-good graphs ⋮ Many H-Copies in Graphs with a Forbidden Tree ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Generalized Turán number of even linear forests ⋮ Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ Hypergraphs with no odd cycle of given length ⋮ Generalized Turán densities in the hypercube ⋮ Further results on the generalized Turán number of spanning linear forests ⋮ Counting cliques in 1-planar graphs ⋮ The generalized Turán number of spanning linear forests

Cites Work

• Pentagons vs. triangles
• On the number of \(C_ 5's\) in a triangle-free graph
• Cycles of even length in graphs
• On maximal paths and circuits of graphs

This page was built for publication: The Maximum Number of Triangles in C_2k+1-Free Graphs