论文标题
$ k_r $的子图密度 - free Graphs
Subgraph densities in $K_r$-free graphs
论文作者
论文摘要
在本文中，我们反驳了Lidický和Murphy的猜想，内容涉及$ K_R $ - Free图中给定图的副本数量，并给出了另一种一般猜想。我们还证明，在无三角形图中，最多2美元的$ 2 $的任何两分图的副本数量均不限制。
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.
