in this talk i will discuss a combinatorial calculation of the polynomial that counts the number of indecomposable representations of a certain quiver and dimension vector. i will start by introducing quivers, their representations and kac's results and conjectures on such counting polynomials in general. the combinatorial calculation involves the reliability polynomial of alternating graphs. i will end with the main motivation for the calculation: its relation to the geometry of character varieties.