Subgraph Densities in $K_r$-Free Graphs

Cograph Complete bipartite graph Induced subgraph
DOI: 10.37236/11329 Publication Date: 2023-03-24T13:09:14Z
ABSTRACT
In this paper we disprove a conjecture of Lidický and Murphy about the number copies given graph in $K_r$-free give an alternative general conjecture. We also prove asymptotically tight bound on any bipartite radius at most~$2$ triangle-free graph.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (0)
CITATIONS (0)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....