你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Combinatorial Nullstellensatz: With Applications to Graph Colouring
Type
Physical Book
Author
Year
2021
Language
English
Pages
152
Format
Hardcover
ISBN13
9780367686949
Edition No.
1
Categories

Combinatorial Nullstellensatz: With Applications to Graph Colouring

Xuding Zhu; R. Balakrishnan (Author) · · Hardcover

Combinatorial Nullstellensatz: With Applications to Graph Colouring - Xuding Zhu; R. Balakrishnan

Cheaper New Book Imported to Taiwan
Delivery: 21 Oct - 03 Nov Shipping: 18 to 22 business days.
NT$ 2,313
Faster New Book Imported to Taiwan
Delivery: 02 Oct - 12 Oct Shipping: 5 to 6 business days.
NT$ 3,913
NT$ 2,313

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Combinatorial Nullstellensatz: With Applications to Graph Colouring "

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. A key step in the applications of Combinatorial Nullstellensatz is to show that the coefficient of a certain monomial in the expansion of a polynomial is nonzero. The major part of the book concentrates on three methods for calculating the coefficients: Alon-Tarsi orientation: The task is to show that a graph has an orientation with given maximum out-degree and for which the number of even Eulerian sub-digraphs is different from the number of odd Eulerian sub-digraphs. In particular, this method is used to show that a graph whose edge set decomposes into a Hamilton cycle and vertex-disjoint triangles is 3-choosable, and that every planar graph has a matching whose deletion results in a 4-choosable graph. Interpolation formula for the coefficient: This method is in particular used to show that toroidal grids of even order are 3-choosable, r-edge colourable r-regular planar graphs are r-edge choosable, and complete graphs of order p+1, where p is a prime, are p-edge choosable. Coefficients as the permanents of matrices: This method is in particular used in the study of the list version of vertex-edge weighting and to show that every graph is (2,3)-choosable. It is suited as a reference book for a graduate course in mathematics.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Hardcover.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews