Abstract
We present an improvement of the inclusion-exclusion principle in which the number of terms is reduced by predicted cancellation. The improvement generalizes a related result of Narushima as well as a graph-theoretic theorem of Whitney. Applications concern chromatic polynomials of graphs and permanents of 0,1-matrices.
Users
Please
log in to take part in the discussion (add own reviews or comments).