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 total coloring of triangle free IC-planar graphs
• 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
• An algebraic formulation of hypergraph colorings
• Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions
• Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
• Local antimagic orientations of \(d\)-degenerate graphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Antimagic labelings of caterpillars
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
• Combinatorial Nullstellensatz and DP-coloring of graphs
• Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
• The Alon-Tarsi number of two kinds of planar graphs
• Local antimagic orientation of graphs
• Neighbor sum distinguishing list total coloring of subcubic graphs
• Squarefree polynomials with prescribed coefficients
• Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs
• Neighbor sum distinguishing total chromatic number of 2-degenerate graphs
• Warning's second theorem with relaxed outputs
• Understanding PPA-completeness
• Local antimagic labeling of graphs
• Operator scaling: theory and applications
• Membership in moment polytopes is in NP and coNP
• Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• Zero sum partition of abelian groups into sets of the same order and its applications
• Book review of: L. Guth, Polynomial methods in combinatorics
• Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph
• Minimal Symmetric Differences of Lines in Projective Planes
• Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
• A nullstellensatz for sequences over \(\mathbb{F}_p\)
• List edge coloring of outer-1-planar graphs
• Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles
• List injective edge-coloring of subcubic graphs
• A non-commutative cryptosystem based on quaternion algebras
• Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
• Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13
• Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing
• Neighbor-sum-distinguishing edge choosability of subcubic graphs
• The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
• List neighbor sum distinguishing edge coloring of subcubic graphs
• Computing the list chromatic index of graphs

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)