Abstract
In this paper we disprove a conjecture of Lidický 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.