We prove several bounds on the number of incidences between two sets of multivariate polynomials of bounded degree over finite fields. From these results, we deduce bounds on incidences between points and multivariate polynomials, extending and strengthening a recent bound of Tamo for points and univariate polynomials. Our bounds are asymptotically tight for a wide range of parameters. To prove these results, we establish a novel connection between the incidence problem and a naturally defined Cayley color graph, in which the weight of colored edges faithfully reflects the number of incidences. This motivates us to prove an expander mixing lemma for general abelian Cayley color graphs, which generalizes the classic mixing lemma of Alon and Chung, and controls the total weight of colored edges crossing two vertex subsets via eigenvalues.