2 papers
math.CO2025
A recursive definition for the polymatroid Tutte polynomial
Xiaxia Guan, Xian'an Jin, Weiling Yang
The Tutte polynomial is a significant invariant of graphs and matroids. It is well-known that it has three equivalent definitions: bases expansion, rank generating function, and de…
math.CO2025
A sharp upper bound for the number of connected sets in any grid graph
Hongxia Ma, Xian'an Jin, Weiling Yang +1
A connected set in a graph is a subset of vertices whose induced subgraph is connected. Although counting the number of connected sets in a graph is generally a \#P-complete proble…