Year: 2025
Type: preprint
Abstract: We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the inversion enumerator polynomials in the colored tree sequences.
Source: arXiv (Cornell University)
Author: Brugidou, Vincent
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4414789916
Cites:
Cited by:
Related to: