Subgraph densities in Kr-free graphs
Abstract
In this paper we disprove a conjecture of Lidick\'y and Murphy about the number of copies of a given graph in a Kr-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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.