Colloquium / Seminars
Topic： Combinatorial Nullstellensatz and its Applications in List Colorings of Graphs
Speaker：Prof. Hsin-Hao Lai
(Department of National Kaohsiung Normal University)
Date time：Oct. 27 14:00 - 15:00
Tea Party：Oct. 27 13:30 (SA205)
Abstract：Abstract. Combinatorial Nullstellensatz is a polynomial method first introduced by Noga Alon in 1999. It became a powerful tool in many fields of combinatorics, including additive combinatorics, combinatorial geometry and graph theory.
Let G be a graph. A list L of G is a mapping that assigns a finite set of integers to each vertex of G. A list L-coloring of G is a mapping that assigns an integer in L(v) to each vertex v of G such that the integers assigned to any two adjacent vertices are different.
In this talk, I will introduce two short proofs of Combinatorial Nullstellen- satz and some applications of Combinatorial Nullstellensatz in the study of list colorings of graphs.