On the Total Weight of Weighted Matchings of Segment Graphs

Thomas Stoll, Jiang Zeng

Abstract


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.


Full Text: PDF