Combinatorial Nullstellensatz

组合零点定理:图染色上的应用

数学史

售   价:
581.00
发货周期:国外库房发货,通常付款后3-5周到货!
作      者
出  版 社
出版时间
2020年11月30日
装      帧
精装
ISBN
9780367686949
复制
页      码
136
开      本
216 x 138 mm (5.5 x 8.5)
语      种
英文
综合评分
5 分
我 要 买
- +
库存 28 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(1)
图书简介
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.
本书暂无推荐
看了又看
  • 上一个
  • 下一个