Combinatorial Nullstellensatz

Combinatorics Probability and Computing

Volumn 8, Issue 1-2, 1999, Pages 7-29

  Alon, Noga ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0442327335     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548398003411     Document Type: Article

References (62)

1. Alon, N. (1991) Non-constructive proofs in combinatorics. In Proc. International Congress of Mathematicians, Kyoto 1990, Japan, Springer, Tokyo, pp. 1421-1429.
2. Alon, N. (1993) Restricted colorings of graphs. In Surveys in Combinatorics, Proc. 14th British Combinatorial Conference, Vol. 187 of London Math. Soc. Lecture Notes (K. Walker, ed.), Cambridge University Press, pp. 1-33.
3. Alon, N. (1995) Tools from higher algebra. In Handbook of Combinatorics (R. Graham, M. Grötschel and L. Lovász, eds), Elsevier, pp. 1749-1783.
4. Alon, N. and Caro, Y. (1993) On three zero-sum Ramsey-type problems. J. Graph Theory 17 177-192.
5. Alon, N. and Dubiner, M. (1993) Zero-sum sets of prescribed size. In Combinatorics: Paul Erdos is Eighty, Vol. 1, Bolyai Society Math. Studies, Keszthely, Hungary, pp. 33-50.
6. Alon, N., Friedland, S. and Kalai, G. (1984) Regular subgraphs of almost regular graphs. J. Combinatorial Theory Ser. B 37 79-91. Also: Alon, N., Friedland, S. and Kalai, G. (1984) Every 4-regular graph plus an edge contains a 3-regular subgraph. J. Combinatorial Theory Ser. B 37 92-93.
7. Alon, N., Friedland, S. and Kalai, G. (1984) Regular subgraphs of almost regular graphs. J. Combinatorial Theory Ser. B 37 79-91. Also: Alon, N., Friedland, S. and Kalai, G. (1984) Every 4-regular graph plus an edge contains a 3-regular subgraph. J. Combinatorial Theory Ser. B 37 92-93.
8. Alon, N. and Füredi, Z. (1993) Covering the cube by affine hyperplanes. European J. Combinatorics 14 79-83.
9. Alon, N., Kleitman, D., Lipton, R., Meshulam, R., Rabin, M. and Spencer, J. (1991), Set systems with no union of cardinality 0 modulo m. Graphs and Combinatorics 7 97-99.
10. Alon, N., Linial, N. and Meshulam, R. (1991) Additive bases of vector spaces over prime fields. J. Combin. Theory Ser. A 57 203-210.
11. Alon, N., Nathanson, M. B. and Ruzsa, I. Z. (1995) Adding distinct congruence classes modulo a prime. Amer. Math. Monthly 102 250-255.
12. Alon, N., Nathanson, M. B. and Ruzsa, I. Z. (1996) The polynomial method and restricted sums of congruence classes. J. Number Theory 56 404-417.
13. Alon, N. and Tarsi, M. (1989) A nowhere-zero point in linear mappings. Combinatorica 9 393-395.
14. Alon, N. and Tarsi, M. (1992) Colorings and orientations of graphs. Combinatorica 12 125-134.
15. Alon, N. and Tarsi, M. (1997) A note on graph colorings and graph polynomials. J. Combin. Theory Ser. B 70 197-201.
16. Babai, L. and Frankl, P. Linear Algebra Methods in Combinatorics. To appear.
17. Blokhuis, A. (1993) Polynomials in finite geometries and combinatorics. In Surveys in Combinatorics, Proc. 14th British Combinatorial Conference, Vol. 187 of London Math. Soc. Lecture Notes (K. Walker, ed.), Cambridge University Press, pp. 35-52.
18. Bollobás, B. (1978) Extremal Graph Theory, Academic Press.
19. Bollobás, B. and Harris, A. J. (1985) List colorings of graphs. Graphs and Combinatorics 1 115-127.
20. Bollobás, B. and Leader, I. (1996) Sums in the grid. Discrete Math. 162 31-48.
21. Chung, F. R. K. (1988) Labelings of graphs. In Selected Topics in Graph Theory, Vol. 3, Academic Press, pp. 151-168.
22. Davenport, H. (1935) On the addition of residue classes. J. London Math. Soc. 10 30-32.
23. Dias da Silva, J. A. and Hamidoune, Y. O. (1994) Cyclic spaces for Grassmann derivatives and additive theory. Bull. London Math. Soc. 26 140-146.
24. Du, D. Z., Hsu, D. F. and Hwang, F. K. (1993) The Hamiltonian property of consecutive-d digraphs. Mathematical and Computer Modelling 7 61-63.
25. Eliahou, S. and Kervaire, M. (1998) Sumsets in vector spaces over finite fields. J. Number Theory 71 12-39.
26. Ellingham, M. N. and Goddyn, L. (1996) List edge colorings of some 1-factorable multigraphs. Combinatorica 16 343-352.
27. Erdos, P. and Graham, R. L. (1980) Old and New Problems and Results in Combinatorial Number Theory, L'Enseignement Mathématique, Geneva.
28. Erdos, P., Ginzburg, A. and Ziv, A. (1961) Theorem in the additive number theory. Bull. Research Council Israel 10F 41-43.
29. Erdos, P., Rubin, A. L. and Taylor, H. (1979) Choosability in graphs. In Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing. Congressus Numerantium XXVI 125-157.
30. Fleischner, H. and Stiebitz, M. (1992) A solution to a coloring problem of P. Erdos. Discrete Math. 101 39-48.
31. Freiman, G. A., Low, L. and Pitman, J. (1993) The proof of Paul Erdos' conjecture of the addition of different residue classes modulo a prime number. In Structure Theory of Set Addition, CIRM Marseille, pp. 99-108.
32. Galvin, F. (1995) The list chromatic index of a bipartite multigraph. J. Combin. Theory Ser. B 63 153-158.
33. Garey, M. R. and Johnson, D. S. (1979) Computers and Intractability: A guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York.
34. Godsil, C. (1995) Tools from linear algebra. In Handbook of Combinatorics (R. Graham, M. Grötschel and L. Lovász, eds), Elsevier, pp. 1705-1748.
35. Häggkvist, R. and Janssen, J. (1997) New bounds on the list chromatic index of the complete graph and other simple graphs. Combin. Probab. Comput. 6 295-313.
36. Harborth, H. (1973) Ein Extremalproblem für Gitterpunkte. J. Reine Angew. Math. 262/263 356-360.
37. Jaeger, F. (1989) On the Penrose number of cubic diagrams. Discrete Math. 74 85-97.
38. Jaeger, F., Linial, N., Payan, C. and Tarsi, M. (1992) Group connectivity of graphs-a nonhomogeneous analogue of nowhere-zero flow. J. Combin. Theory Ser. B 56 165-182.
39. Johnson, D. S., Papadimitriou, C. H. and Yannakakis, M. (1988) How easy is local search? JCSS 37 79-100.
40. Kahn, J. (1996) Asymptotically good list colorings. J. Combin. Theory Ser. A 73 1-59.
41. Kemnitz, A. (1983) On a lattice point problem. Ars Combinatoria 16b 151-160.
42. Li, S. Y. R. and Li, W. C. W. (1981) Independence numbers of graphs and generators of ideals. Combinatorica 1 55-61.
43. Lovász, L. (1982) Bounding the independence number of a graph. In Bonn Workshop on Combinatorial Optimization (A. Bachem, M. Grötschel and B. Korte, eds), Ann. Discrete Math. 16, North Holland, Amsterdam, pp. 213-223.
44. Lovász, L. (1994) Stable sets and polynomials. Discrete Math. 124 137-153.
45. Mansfield, R. (1981) How many slopes in a polygon? Israel J. Math. 39 265-272.
46. Macmahon, M. P. A. (1915) Combinatory Analysis, Chelsea Publishing Company.
47. Nathanson, M. B. (1996) Additive Number Theory: Inverse Theorems and the Geometry of Sumsets, Springer, New York.
48. Petersen, J. (1891) Die Theorie der regulären Graphs. Acta Math. 15 193-220.
49. Pyber, L. (1985) Regular subgraphs of dense graphs. Combinatorica 5 347-349.
50. Pyber, L., Rödl, V. and Szemerédi, E. (1995) Dense graphs without 3-regular subgraphs. J. Combin. Theory Ser. B 63 41-54.
51. Rickert, U.-W. (1976) Über eine Vermutung in der additiven Zahlentheorie, PhD thesis, Tech. Univ. Braunschweig.
52. Rödseth, Ö. J. (1994) Sums of distinct residues mod p. Acta Arith. 65 181-184.
53. Scheim, D. E. (1974) The number of edge 3-colorings of a planar cubic graph as a permanent. Discrete Math. 8 377-382.
54. Schmidt, W. (1976) Equations over Finite Fields: An Elementary Approach, Vol. 536 of Lecture Notes in Mathematics, Springer, Berlin.
55. Taśkinov, V. A. (1982) Regular subgraphs of regular graphs. Soviet Math. Dokl. 26 37-38.
56. Toft, B. Private communication, July 1998.
57. m. SIAM J. Discrete Math. 9 55-62.
58. Vigneron, L. (1946) Remarques sur les réseaux cubiques de classe 3 associés au probléme des quatre couleurs. C. R. Acad. Sc. Paris, 223 770-772.
59. Vizing, V. G. (1964) On an estimate on the chromatic class of a p-graph. Diskret. Analiz. 3 25-30. In Russian.
60. Vizing, V. G. (1976) Coloring the vertices of a graph in prescribed colors (in Russian), Diskret. Analiz. No. 29, Metody Diskret. Anal. v. Teorii Kodov i Shem 101 3-10.
61. van der Waerden, B. L. (1931) Modern Algebra, Julius Springer, Berlin.
62. Yuzvinsky, S. (1981) Orthogonal pairings of Euclidean spaces. Michigan Math. J. 28 109-119.