Combinatorial Nullstellensatz

DOI10.1017/S0963548398003411zbMATH Open0920.05026WikidataQ64117603 ScholiaQ64117603MaRDI QIDQ4243069FDOQ4243069

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 ring graph colouring regular graph graph bandwidth Hilbert's Nullstellensatz ideal of polynomials residue 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 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
A note on degree-constrained subgraphs
A new class of antimagic Cartesian product graphs
Transversals of additive Latin squares
Zero-sum subsets in vector spaces over finite fields
Combinatorial Nullstellensatz
On the existence of zero-sum subsequences of distinct lengths
Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
On 2-coloring certain $k$-uniform hypergraphs
Every nice graph is (1,5)-choosable
Total weight choosability for Halin graphs
Some combinatorial applications of Gröbner bases
Additive Latin transversals and group rings.
On two generalizations of the Alon-Tarsi polynomial method
Additive Latin transversals.
Total Weight Choosability of Trees
Permutations, hyperplanes and polynomials over finite fields
On an effective variation of Kronecker's approximation theorem avoiding algebraic sets
Asymptotically optimal neighbour sum distinguishing colourings of graphs
Maximal rank in matrix spaces via graph matchings
Tropical combinatorial Nullstellensatz and sparse polynomials
Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
Chevalley's theorem with restricted variables
Uniform bounds for the number of rational points on varieties over global fields
On various restricted sumsets
The $1,2,3$-conjecture and $1,2$-conjecture for sparse graphs
Quadratic adelic spaces
On the sumset partition problem
The Combinatorial Nullstellensätze revisited
Solving a fixed number of equations over finite groups
Combinatorial nullstellensatz modulo prime powers and the parity argument
Warning's second theorem with restricted variables
Read-once polynomial identity testing
On irreduceability of Boolean functions with respect to commutative associative operation
A note on Alon's combinatorial Nullstellensatz
Total weight choosability of graphs: towards the 1-2-3-conjecture
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
A generalized combinatorial nullstellensatz for multisets
A Bertini-type theorem for free arithmetic linear series
Adjacent vertex distinguishing colorings by sum of sparse graphs
The weighted Davenport constant of a group and a related extremal problem
Parity, Eulerian subgraphs and the Tutte polynomial
A duality based proof of the combinatorial nullstellensatz
On the strong chromatic index of sparse graphs
Total weight choosability of graphs with bounded maximum average degree
On a permutation problem for finite abelian groups
Parity and strong parity edge-colorings of graphs
On weight choosabilities of graphs with bounded maximum average degree
The degree and regularity of vanishing ideals of algebraic toric sets over finite fields
On a Häggkvist's Conjecture with the Polynomial Method
$\rho$-valuations for some stunted trees
Neighbor sum distinguishing edge coloring of subcubic graphs
Approximate results for rainbow labelings
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.

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)