Combinatorial Nullstellensatz
From MaRDI portal
Publication:4243069
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
polynomial ringgraph colouringregular graphgraph bandwidthHilbert's Nullstellensatzideal of polynomialsresidue class
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
- 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.
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)
