Localised graph Maclaurin inequalities
From MaRDI portal
Abstract: The Maclaurin inequalities for graphs are a broad generalisation of the classical theorems of Tur'an and Zykov. In a nutshell they provide an asymptotically sharp answer to the following question: what is the maximum number of cliques of size in a -free graph with a given number of cliques of size ? We prove an extensions of the graph Maclaurin inequalities with a weight function that captures the local structure of the graph. As a corollary, we settle a recent conjecture of Kirsch and Nir, which simultaneously encompass the previous localised results of Bradav{c}, Malec and Tompkins and of Kirsch and Nir.
This page was built for publication: Localised graph Maclaurin inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6424890)
