Subgraph densities in $K_r$-free graphs
Combinatorics
2022-05-27 v1
Abstract
In this paper we disprove a conjecture of Lidick\'y and Murphy about the number of copies of a given graph in a -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 in a triangle-free graph.
Cite
@article{arxiv.2205.13455,
title = {Subgraph densities in $K_r$-free graphs},
author = {Andrzej Grzesik and Ervin Győri and Nika Salia and Casey Tompkins},
journal= {arXiv preprint arXiv:2205.13455},
year = {2022}
}