Pentagons in triangle-free graphs

DOI10.1016/j.ejc.2018.07.008zbMath1394.05061arXiv1712.08869OpenAlexW2780185028MaRDI QIDQ1671749

Bernard Lidický, Florian Pfender

Publication date: 7 September 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

triangle-free graphspentagonsbalanced blow-ups

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (8)

C5 ${C}_{5}$ is almost a fractalizer ⋮ On supersaturation and stability for generalized Turán problems ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ Strong forms of stability from flag algebra calculations ⋮ Semidefinite Programming and Ramsey Numbers ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ Minimizing the number of 5-cycles in graphs with given edge-density ⋮ Inducibility of directed paths

Uses Software

• Flagmatic

Cites Work

• Unnamed Item
• Unnamed Item
• On the maximum number of five-cycles in a triangle-free graph
• Limits of dense graph sequences
• On the number of pentagons in triangle-free graphs
• Flag algebras

This page was built for publication: Pentagons in triangle-free graphs