Subgraph densities in K_r-free graphs

2022/05/26 by Grzesik, Andrzej, Győri, Ervin, Salia, Nika +1
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2205.13455

Abstract

In this paper we disprove a conjecture of Lidický and Murphy about the number of copies of a given graph in a K_r-free graph and give an alternative general conjecture. We also prove an asymptotically tight bound on the number of copies of any bipartite graph of radius at most 2 in a triangle-free graph.

Related

• Density of small diameter subgraphs in K_r-free graphs
• Many T copies in H-free graphs
• On a Conjecture of Nagy on Extremal Densities
• Generalized Ramsey--Turán density for cliques
• Subgraph densities in signed graphons and the local Sidorenko conjecture