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 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
• The neighbour sum distinguishing relaxed edge colouring
• On the neighbour sum distinguishing index of graphs with bounded maximum average degree
• Representation theorems for partially exchangeable random variables
• The multidimensional truncated moment problem: Carathéodory numbers from Hilbert functions
• Approximation by multivariate higher degree \(F\)-transform based on B-splines
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs
• Algebraic properties of modulo \(q\) complete \(\ell \)-wide families
• On the generalized restricted sumsets in abelian groups
• On permutations of \(\{1,\ldots ,n\}\) and related topics
• 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

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)