Loupe
Search Loader

R. Balakrishnan & Xuding Zhu 
Combinatorial Nullstellensatz 
With Applications to Graph Colouring

Support
Adobe DRM
Couverture du R. Balakrishnan & Xuding Zhu: Combinatorial Nullstellensatz (ePUB)
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.
€25.00
méthodes de payement
Langue Anglais ● Format EPUB ● Pages 150 ● ISBN 9781000426694 ● Maison d’édition CRC Press ● Publié 2021 ● Téléchargeable 3 fois ● Devise EUR ● ID 7853273 ● Protection contre la copie Adobe DRM
Nécessite un lecteur de livre électronique compatible DRM

Plus d’ebooks du même auteur(s) / Éditeur

47 161 Ebooks dans cette catégorie