Combinatorial Nullstellensatz

DOI10.1017/S0963548398003411zbMATH Open0920.05026WikidataQ64117603 ScholiaQ64117603MaRDI QIDQ4243069FDOQ4243069

Authors: Noga Alon 

Publication date: 10 September 1999

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Recommendations

• A duality based proof of the combinatorial nullstellensatz
• A generalization of Alon's combinatorial nullstellensatz
• Punctured combinatorial Nullstellensätze
• A short proof of combinatorial Nullstellensatz

zbMATH Keywords

polynomial ringgraph colouringregular graphgraph bandwidthHilbert's Nullstellensatzideal of polynomialsresidue class

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Coloring of graphs and hypergraphs (05C15) Other combinatorial number theory (11B75) Polynomials over commutative rings (13B25)

Cited In (only showing first 100 items - show all)

• Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
• Restricted set addition: the exceptional case of the Erdős-Heilbronn conjecture
• On a conjecture of Graham and Häggkvist with the polynomial method
• A new extension of the Erdős-Heilbronn conjecture
• Punctured combinatorial Nullstellensätze
• Characterizing arithmetic read-once formulae
• Optimal strong parity edge-coloring of complete graphs
• The permanent rank of a matrix
• The minimum distance of parameterized codes on projective tori
• Additive coloring of planar graphs
• Zero-sum problems and coverings by proper cosets
• Neighbor sum distinguishing index of subcubic graphs
• Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
• Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
• Neighbor sum distinguishing index of sparse graphs
• Lucky labelings of graphs
• On the modular sumset partition problem
• Weighted-1-antimagic graphs of prime power order
• The primes contain arbitrarily long polynomial progressions
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• On Snevily's conjecture and restricted sumsets.
• Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
• Neighbor sum distinguishing total choosability of planar graphs
• Matrix choosability
• Total weight choosability of graphs
• The complexity of approximating conservative counting CSPs
• Total weight choosability of cone graphs
• Polynomial approach to explicit formulae for generalized binomial coefficients
• On the lucky choice number of graphs
• On the neighbor sum distinguishing total coloring of planar graphs
• On value sets of polynomials over a field
• A lower bound for \(|\{a+b: a\in A,\;b\in B,\;P(a,b)\neq 0\}|\)
• Sums of subsets with polynomial restrictions.
• Zero-sum flows in regular graphs
• Total weight choosability of Cartesian product of graphs
• On the subset sum problem over finite fields
• Permanent index of matrices associated with graphs
• Total weight choosability of Mycielski graphs
• Every graph is \((2,3)\)-choosable
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
• Algebraic points of small height missing a union of varieties
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
• A generalization of combinatorial Nullstellensatz
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Coloring, sparseness and girth
• Lower bounds for monotone counting circuits
• List-antimagic labeling of vertex-weighted graphs
• The 1-2-3-conjecture for hypergraphs
• Weighted antimagic labeling: an algorithmic approach
• Finite phylogenetic complexity of \(\mathbb{Z}_p\) and invariants for \(\mathbb{Z}_3\)
• On proper edge 3-colorings of a cubic graph
• Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
• Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
• A Polyhedral Characterization of Border Bases
• Brooks' theorem via the Alon-Tarsi theorem
• Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz revisited
• Proof of the list edge coloring conjecture for complete graphs of prime degree
• Affine Cartesian codes
• An addition theorem and maximal zero-sum free sets in \(\mathbb{Z}/p\mathbb{Z}\)
• A simple proof of the Zeilberger-Bressoud \(q\)-Dyson theorem
• Partitions of nonzero elements of a finite field into pairs
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• On total weight choosability of graphs
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• A note on the neighbor sum distinguishing total coloring of planar graphs
• A new approach to constant term identities and Selberg-type integrals
• Antimagic labelling of vertex weighted graphs
• The number of roots of a polynomial system
• Pair dominating graphs
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• Weighted antimagic labeling
• Enumeration of non-crossing pairings on bit strings
• Unification of zero-sum problems, subset sums and covers of ℤ
• Vanishing ideals over finite fields
• Equal entries in totally positive matrices
• Zero-sum problems in finite Abelian groups: a survey
• Alon's nullstellensatz for multisets
• Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
• Neighbor sum distinguishing total choosability of IC-planar graphs
• Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
• Essential positive covers of the cube
• Neighbor sum distinguishing total chromatic number of planar graphs
• Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method
• A compactness argument in the additive theory and the polynomial method.
• The polynomial method for list-colouring extendability of outerplanar graphs
• On restricted sumsets over a field
• Exterior algebras and two conjectures on finite Abelian groups.
• Improper choosability and property B
• A note on edge weight choosability of graphs
• Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
• On the neighbor sum distinguishing index of planar graphs
• On-line list coloring of matroids
• On two questions about circular choosability
• Graphs are \((1, \varDelta + 1)\)-choosable
• On weighted zero-sum sequences
• Partial matrices all of whose completions have the same spectrum

This page was built for publication: Combinatorial Nullstellensatz

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243069)