Subgraph densities in \(K_r\)-free graphs

DOI10.37236/11329OpenAlexW4360849062MaRDI QIDQ2699640

Andrzej Grzesik, Casey Tompkins, Nika Salia, Ervin Gyoeri

Publication date: 19 April 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

triangle-free graphsextremal graph theorypentagon density

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42)

Related Items (1)

Every graph is eventually Turán-good

Cites Work

• Unnamed Item
• Unnamed Item
• On the maximum number of five-cycles in a triangle-free graph
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• On the number of pentagons in triangle-free graphs
• On Turán-good graphs
• Maximizing five-cycles in \(K_r\)-free graphs
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Subgraph densities in \(K_r\)-free graphs