2025/09/25 by Brugidou, Vincent
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2509.20959
We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs Kn%. This generalizes, to two variables, a relation previously obtained by the author between the inversion enumerator polynomials in the colored tree sequences.