Store besparelser
Hurtig levering
Fri fragt over 499,-
Gemte
Log ind
0
Kurv
Bøger
Bestsellers
Kommer snart
Nyheder
Store besparelser
Fri fragt over 499,-
Hjem
Kategorier
Bestsellers
Kommer snart
Nyheder
FAQ
Konto
Kontakt
Kurv
  1. Bog
  2. Matematik
  3. Diskret matematik
Combinatorial Nullstellensatz
- With Applications to Graph Colouring
Af: R. Balakrishnan, Xuding Zhu
Engelsk
Bogcover for Combinatorial Nullstellensatz af R. Balakrishnan, Xuding Zhu, 9780367686949
Specifikationer
Sprog:
Engelsk
Sider:
134
ISBN-13:
9780367686949
Indbinding:
Hardback
ISBN-10:
0367686945
Kategori:
Udg. Dato:
1 jun 2021
Størrelse i cm:
14,5 x 22,3 x 1,7
Forlag:
Oplagsdato:
1 jun 2021
Forfatter(e):
Genre:

Combinatorial Nullstellensatz

- With Applications to Graph Colouring
Af: R. Balakrishnan, Xuding Zhu
Engelsk
Hardback 2021
Format:
Hardback
Bog beskrivelse

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:

  1. 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.

  2. 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.

  3. 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.

... Vis mere
Hos Booktok
573 kr
Læg i kurv nu
Sikker betaling
23 - 25 hverdage
Specifikationer
Sprog:
Engelsk
Sider:
134
ISBN-13:
9780367686949
Indbinding:
Hardback
ISBN-10:
0367686945
Kategori:
Udg. Dato:
1 jun 2021
Størrelse i cm:
14,5 x 22,3 x 1,7
Forlag:
Oplagsdato:
1 jun 2021
Forfatter(e):
Finder produkter...
Kategori sammenhænge