A short proof of Combinatorial Nullstellensatz

Abstract

In this note we give a short, direct proof of the well known Combinatorial Nullstellensatz.

Cited by in corpus (5)

• A generalization of Combinatorial Nullstellensatz
• Additive colorings of planar graphs
• Graph Polynomials and Group Coloring of Graphs
• Finite phylogenetic complexity of $Z_p$ and invariants for $Z_3$
• Computational Aspects of the Combinatorial Nullstellensatz Method