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)

• A polynomial method approach to zero-sum subsets in \(\mathbb F_p^2\)
• Combinatorial Nullstellensatz approach to polynomial expansion
• Covering symmetric sets of the Boolean cube by affine hyperplanes
• Some criteria for a signed graph to have full rank
• On almost \(k\)-covers of hypercubes
• Graph polynomials and paintability of plane graphs
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• Asymptotics of traces of paths in the Young and Schur graphs
• On zeros of multilinear polynomials
• Addition of sets via symmetric polynomials - a polynomial method
• Permutations over cyclic groups
• An inverse theorem for the restricted set addition in Abelian groups.
• The polynomial method in the study of zero-sum theorems
• Value sets of polynomials and the Cauchy-Davenport theorem.
• On the complexity of Hilbert refutations for partition
• Nearly holomorphic automorphic forms on \(\mathrm{SP}_{2n}\) with sufficiently regular infinitesimal characters and applications
• Neighbor sum distinguishing total coloring of graphs with bounded treewidth
• On a list variant of the multiplicative 1-2-3 conjecture
• The Alon-Tarsi number of a planar graph minus a matching
• Building above read-once polynomials: identity testing and hardness of representation
• Remarks on some zero-sum theorems
• Caterpillars are antimagic
• On a Lovász-type lemma, applied to Brooks' theorem for list-colouring
• The combinatorial Nullstellensatz and DFT on perfect matchings in bipartite graphs.
• Weakening the conditions in some classical theorems on linear preserver problems
• Title not available (Why is that?)
• Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
• Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits
• Constant terms of near-Dyson polynomials
• Between Proper and Strong Edge-Colorings of Subcubic Graphs
• On systems of diagonal forms II
• Polynomials that Vanish on Distinct $n$ th Roots of Unity
• The Erdős-Heilbronn problem in Abelian groups.
• Restricted set addition in abelian groups: results and conjectures
• Restricted sumsets and a conjecture of Lev
• Derandomization from Algebraic Hardness
• The hat guessing number of graphs
• Neighbor sum distinguishing total coloring of planar graphs without 4-cycles
• Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility
• Spectral aspects of symmetric matrix signings
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• Covering almost all the layers of the hypercube with multiplicities
• Affine Cartesian codes with complementary duals
• Between proper and strong edge‐colorings of subcubic graphs
• Schwartz-Zippel bounds for two-dimensional products
• Constant term identities and Poincaré polynomials
• Neighbor sum distinguishing total coloring of IC-planar graphs
• Polynomials over structured grids
• A variant of Tao's method with application to restricted sumsets
• The list-chromatic index of \(K_6\)
• Strong list-chromatic index of subcubic graphs
• An algebraic perspective on integer sparse recovery
• On the cylinder conjecture
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
• Linear extension of the Erdős-Heilbronn conjecture
• 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

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)