On the conjectured upper bounds for entries of mutation count matrices

AbstractSimple expressions for the previously given conjectural upper bounds for the entries of mutation count matrices are presented

Expansions for the Bollobas-Riordan polynomial of separable ribbon graphs

We define 2-decompositions of ribbon graphs, which generalise 2-sums and tensor products of graphs. We give formulae for the Bollobas-Riordan polynomial of such a 2-decomposition, and derive the classical Brylawski formula for the Tutte polynomial of a tensor product as a (very) special case. This study was initially motivated from knot theory, and we include an application of our formulae to mutation in knot diagrams.Comment: Version 2 has minor changes. To appear in Annals of Combinatoric