Sách A generalization of Combinatorial Nullstellensatz

Abstract
In this note we give an extended version of Combinatorial Nullstellensatz, with
weaker assumption on nonvanishing monomial. We also present an application of
our result in a situation where the original theorem does not seem to work.
In this paper we extend this theorem by weakening the assumption on the degree of
nonvanishing monomial. We also provide an explicit formula for coefficients of monomials
in the usual expansion of f. Similar results were obtained independently by Schauz [5],
however our proofs are simple and more direct. The paper is concluded with an application
to a graph labeling problem for which classical approach does not seem to work.