The talk is based on the paper arXiv:2212.10920v1 Irreducibility of the Tutte polynomial of an embedded graph by J.A. Ellis-Monaghan, A. J. Goodall, I. Moffatt, S.Noble, L.Viena.
The central result consists in the proof of the fact that the Tutte polynomial of a ribbon graph G is irreducible iff G is not a disjunctive union of embedded graphs.
This result is equivalent to the statement that the Tutte polynomial of a graph G is irreducible iff G is connected and nonseparable.
I will briefly recall the required notions most of which have been introduced at the previous meetings of the seminar
22 апр 2024
