Subgraph Densities in $K_r$-Free Graphs
-
Published:2023-03-24
Issue:1
Volume:30
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
Grzesik Andrzej,Győri Ervin,Salia Nika,Tompkins Casey
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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On Triangle-Free Graphs Maximizing Embeddings of Bipartite Graphs;The Electronic Journal of Combinatorics;2024-06-14
2. Every graph is eventually Turán-good;Journal of Combinatorial Theory, Series B;2023-09
3. On weakly Turán-good graphs;Discussiones Mathematicae Graph Theory;2023