On the total weight of weighted matchings of segment graphs

Thomas Stoll (1) , Jiang Zeng (2)

1 UWO - School of Computer Science [Waterloo]
2 ICJ - Institut Camille Jordan

We study the total weight of weighted matchings in segment graphs, which is related to a question concerning generalized Chebyshev polynomials introduced by Vauchassade de Chaumont and Viennot and, more recently, investigated by Kim and Zeng. We prove that weighted matchings with sufficiently large node-weight cannot have equal total weight.

Domaines: Combinatoire [math.CO]

Thomas Stoll, Jiang Zeng. On the total weight of weighted matchings of segment graphs. The Electronic Journal of Combinatorics, 2009, 16, pp.R56. ⟨hal-00943747⟩