Combinatorial Nullstellensatz

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.

[1]  J. Petersen.  Die Theorie der regulären graphs , 1891 .

[2]  A. B. BASSET,et al.  Modern Algebra , 1905, Nature.

[3]  J. Shaw.  Combinatory Analysis , 1917, Nature.

[4]  Olga Taussky,et al.  Moderne Algebra , 1933 .

[5]  S. S. Pillai.  On the addition of residue classes , 1938 .

[6]  Burton Randol,et al.  A lattice-point problem , 1966 .

[7]  Heiko Harborth,et al.  Ein Extremalproblem für Gitterpunkte. , 1973 .

[8]  David E. Scheim,et al.  The number of edge 3-colorings of a planar cubic graph as a permanent , 1974, Discret. Math..

[9]  W. Schmidt.  Equations over Finite Fields: An Elementary Approach , 1976 .

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  B. Bollobás.  Surveys in Combinatorics , 1979 .

[12]  P. Erdos,et al.  Old and new problems and results in combinatorial number theory , 1980 .

[13]  Richard Mansfield.  How many slopes in a polygon? , 1981 .

[14]  Shuo-Yen Robert Li,et al.  Independence numbers of graphs and generators of ideals , 1981, Comb..

[15]  Sergey Yuzvinsky,et al.  Orthogonal pairings of Euclidean spaces. , 1981 .

[16]  László Lovász,et al.  Bounding the Independence Number of a Graph , 1982 .

[17]  Noga Alon,et al.  Regular subgraphs of almost regular graphs , 1984, J. Comb. Theory, Ser. B.

[18]  Noga Alon,et al.  Every 4-regular graph plus an edge contains a 3-regular subgraph , 1984, Journal of combinatorial theory. Series B (Print).

[19]  László Pyber,et al.  Regular subgraphs of dense graphs , 1985, Comb..

[20]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[21]  P. Frankl,et al.  Linear Algebra Methods in Combinatorics I , 1988 .

[22]  J. Chahal.  Equations over Finite Fields , 1988 .

[23]  François Jaeger,et al.  On the penrose number of cubic diagrams , 1989, Discret. Math..

[24]  Noga Alon,et al.  A nowhere-zero point in linear mappings , 1989, Comb..

[25]  Noga Alon,et al.  Set systems with no union of cardinality 0 modulom , 1991, Graphs Comb..

[26]  Noga Alon,et al.  Additive bases of vector spaces over prime fields , 1991, J. Comb. Theory, Ser. A.

[27]  Noga Alon,et al.  Colorings and orientations of graphs , 1992, Comb..

[28]  Nathan Linial,et al.  Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties , 1992, J. Comb. Theory, Ser. B.

[29]  Michael Stiebitz,et al.  A solution to a colouring problem of P. Erdös , 1992, Discret. Math..

[30]  Noga Alon,et al.  Covering the Cube by Affine Hyperplanes , 1993, Eur. J. Comb..

[31]  Ding-Zhu Du,et al.  The Hamiltonian property of consecutive-d digraphs , 1993 .

[32]  Noga Alon,et al.  Zero-sum sets of prescribed size , 1993 .

[33]  Aart Blokhuis.  Polynomials in finite geometries and combinatorics , 1993 .

[34]  Noga Alon,et al.  On three zero-sum Ramsey-type problems , 1993, J. Graph Theory.

[35]  Øystein J. Rødseth.  Sums of distinct residues mod p , 1993 .

[36]  N. Alon.  Restricted colorings of graphs , 1993 .

[37]  J. A. Dias da Silva,et al.  Cyclic Spaces for Grassmann Derivatives and Additive Theory , 1994 .

[38]  László Lovász,et al.  Stable sets and polynomials , 1994, Discret. Math..

[39]  D. Eisenbud.  Commutative Algebra: with a View Toward Algebraic Geometry , 1995 .

[40]  Fred Galvin,et al.  The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory B.

[41]  Noga Alon,et al.  Adding Distinct Congruence Classes Modulo a Prime , 1995 .

[42]  Vojtech Rödl,et al.  Dense Graphs without 3-Regular Subgraphs , 1995, J. Comb. Theory, Ser. B.

[43]  Béla Bollobás,et al.  Sums in the grid , 1996, Discret. Math..

[44]  Shi-Chun Tsai,et al.  Lower Bounds on Representing Boolean Functions as Polynomials in Zm , 1996, SIAM J. Discret. Math..

[45]  Noga Alon,et al.  The Polynomial Method and Restricted Sums of Congruence Classes , 1996 .

[46]  Jeff Kahn,et al.  Asymptotically Good List-Colorings , 1996, J. Comb. Theory A.

[47]  Mark N. Ellingham,et al.  List edge colourings of some 1-factorable multigraphs , 1996, Comb..

[48]  N. Alon.  Tools from higher algebra , 1996 .

[49]  Melvyn B. Nathanson,et al.  Additive Number Theory: Inverse Problems and the Geometry of Sumsets , 1996 .

[50]  Chris Godsil,et al.  Tools from linear algebra , 1996 .

[51]  Roland Häggkvist,et al.  New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs , 1997, Combinatorics, Probability and Computing.

[52]  Noga Alon,et al.  A Note on Graph Colorings and Graph Polynomials , 1997, J. Comb. Theory, Ser. B.

[53]  Michel Kervaire,et al.  Sumsets in Vector Spaces over Finite Fields , 1998 .

[54]  Sums of distinct residues mod p by , .

[55]  A. Ziv,et al.  Theorem in the Additive Number Theory , 2022 .