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.