Read more
Combinatorial Nullstellensatz is a novel theorem in algebra introduced by Noga Alon to tackle combinatorial problems in diverse areas of mathematics. This book focuses on the applications of this theorem to graph colouring.
List of contents
Some definitions and notations. Combinatorial Nullstellensatz. Alon-Tarsi Theorem and its Applications. Generalizations of CNS and applications. Permanent and vertex-edge weighting.
About the author
Xuding Zhu is currently a Professor of Mathematics, director of the Center for Discrete Mathematics at Zhejiang Normal University, China. His fields of interests are: Combinatorics and Graph Colouring. He published more than 260 research papers and served on the editorial board of SIAM Journal on Discrete Mathematics, Journal of Graph Theory, European Journal of Combinatorics, Electronic Journal of Combinatorics, Discrete Mathematics, Contribution to Discrete Mathematics, Discussion. Math. Graph Theory, Bulletin of Academia Sinica and Taiwanese Journal of Mathematics.
R. Balakrishnan is currently an Adjunct Professor of Mathematics at Bharathidasan University, Triuchirappalli, India. His fields of interests are: Algebraic Combinatorics and Graph Colouring. He is an author of three other books, one in Graph Theory and the other two in Discrete Mathematics. He is also one of the founders of the Ramanujan Mathematical Society and the Academy of Discrete Mathematics and Applications and currently an Editor-in-Chief of the Indian Journal of Discrete Mathematics.
Summary
Combinatorial Nullstellensatz is a novel theorem in algebra introduced by Noga Alon to tackle combinatorial problems in diverse areas of mathematics. This book focuses on the applications of this theorem to graph colouring.
