Combinatorial Nullstellensatz

Noga Alon

doi:10.1017/S0963548398003411

Combinatorial Nullstellensatz

Noga Alon

Research output: Contribution to journal › Article › peer-review

524 Scopus citations

Abstract

We present a general algebraic technique and discuss some of its numerous applications in combinatorial number theory, in graph theory and in combinatorics. These applications include results in additive number theory and in the study of graph colouring problems. Many of these are known results, to which we present unified proofs, and some results are new.

Original language	English (US)
Pages (from-to)	7-29
Number of pages	23
Journal	Combinatorics Probability and Computing
Volume	8
Issue number	1-2
DOIs	https://doi.org/10.1017/S0963548398003411
State	Published - 1999
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Statistics and Probability
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1017/S0963548398003411

Cite this

@article{579fc8c9cbe2415fa374c6994c94b968,

title = "Combinatorial Nullstellensatz",

abstract = "We present a general algebraic technique and discuss some of its numerous applications in combinatorial number theory, in graph theory and in combinatorics. These applications include results in additive number theory and in the study of graph colouring problems. Many of these are known results, to which we present unified proofs, and some results are new.",

author = "Noga Alon",

year = "1999",

doi = "10.1017/S0963548398003411",

language = "English (US)",

volume = "8",

pages = "7--29",

journal = "Combinatorics Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "1-2",

}

TY - JOUR

T1 - Combinatorial Nullstellensatz

AU - Alon, Noga

PY - 1999

Y1 - 1999

N2 - We present a general algebraic technique and discuss some of its numerous applications in combinatorial number theory, in graph theory and in combinatorics. These applications include results in additive number theory and in the study of graph colouring problems. Many of these are known results, to which we present unified proofs, and some results are new.

AB - We present a general algebraic technique and discuss some of its numerous applications in combinatorial number theory, in graph theory and in combinatorics. These applications include results in additive number theory and in the study of graph colouring problems. Many of these are known results, to which we present unified proofs, and some results are new.

UR - http://www.scopus.com/inward/record.url?scp=0442327335&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0442327335&partnerID=8YFLogxK

U2 - 10.1017/S0963548398003411

DO - 10.1017/S0963548398003411

M3 - Article

AN - SCOPUS:0442327335

SN - 0963-5483

VL - 8

SP - 7

EP - 29

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

IS - 1-2

ER -

Combinatorial Nullstellensatz

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this