Let $M$ be a matroid and let $\Tutte_M(x,y)$ be its Tutte polynomial. The multiplicative Merino--Welsh inequality \[ \Tutte_M(2,0)\Tutte_M(0,2)\geq \Tutte_M(1,1)^2 \] was proved to be false for matroids by Beke, Cs\'aji, Csikv\'ari, and Pituk (\emph{Adv. Math.} \textbf{446} (2024), 109674). Let $U_{n,r}$ denote the ran...
For a finite simple graph $G$ of positive order, let $s_k(G)$ be the number of its $k$-vertex tree subgraphs. We prove that, among graphs of a fixed order $n$, the ratios $s_k(G)/s_k(K_n)$ form a nonincreasing sequence in $k$. It follows that the complete graph maximizes the mean subtree order: $\mu(G)\leq\mu(K_n)$, wi...
Jun-Gang Chen, Xian'an Jin, Zhuo Li et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.