A graph-theoretic proof of Cramer's rule

[1] M. Aigner, A Course in Enumeration, Graduate Texts in Mathematics, vol. 238, Springer, Berlin, 2007.

[2] J.P. Ballantine, Discussions: A graphical derivation of Cramer’s rule, Am. Math. Mon. 36 (1929), no. 8, 439–441.
https://doi.org/10.2307/2299943

[3] S. Bera and S.K. Mukherjee, Combinatorial proofs of some determinantal identities, Linear Multilinear Algebra 66 (2018), no. 8, 1659–1667.  https://doi.org/10.1080/03081087.2017.1366970

[4] C.B. Boyer, Colin Maclaurin and Cramers rule, Scripta Math. 27 (1966), 377–379.

[5] M. Brunetti, Old and new proofs of Cramer’s rule, Appl. Math. Sci. 8 (2014), no. 133, 6689 – 6697. http://dx.doi.org/10.12988/ams.2014.49683

[6] G. Cramer, Introduction `a l’analyse des lignes courbes alg´ebriques, Chez les frères Cramer et C. Philibert, 1750.

[7] B.A. Hedman, An earlier date for “Cramer’s rule”, Hist. Math. 26 (1999), no. 4, 365–368. https://doi.org/10.1006/hmat.1999.2247

[8] C.G.J. Jacobi, De formatione et proprietatibus determinatium., J. fur Reine Angew. Math. 1841 (1841), no. 22, 285–318.
https://doi.org/10.1515/crll.1841.22.285

[9] O. Knill, Cauchy–Binet for pseudo-determinants, Linear Algebra Appl. 459 (2014), 522–547. https://doi.org/10.1016/j.laa.2014.07.013

[10] T. Muir, The Theory of Determinants in the Historical Order of Development, vol. 1, Macmillan and Company, limited, 1906.

[11] R.P. Stanley, A matrix for counting paths in acyclic digraphs, J. Comb. Theory, Ser. A. 74 (1996), no. 1, 169–172.
https://doi.org/10.1006/jcta.1996.0046

[12] A-T. Vandermonde, Mémoire sur I’élimination, Hist. de l’Acad. Roy. des Sciences, Paris, 1772.

[13] D. Zeilberger, A combinatorial proof of Cramer’s rule, arXiv:2408.10282 [math.CO] (2024).