Combinatorial Nullstellensatz
From MaRDI portal
Publication:4243069
Recommendations
Cited in
(only showing first 100 items - show all)- An algorithm for identifying cycle-plus-triangles graphs
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
- A compactness argument in the additive theory and the polynomial method.
- 2-colorability of \(r\)-uniform hypergraphs
- On finding constrained independent sets in cycles
- A polynomial method approach to zero-sum subsets in \(\mathbb F_p^2\)
- Combinatorial anti-concentration inequalities, with applications
- The Alon-Tarsi number of a toroidal grid
- Codes for Distributed Storage
- On restricted sumsets over a field
- Combinatorial Nullstellensatz approach to polynomial expansion
- The polynomial method for list-colouring extendability of outerplanar graphs
- Covering symmetric sets of the Boolean cube by affine hyperplanes
- Exterior algebras and two conjectures on finite Abelian groups.
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- Graph polynomials and paintability of plane graphs
- Some criteria for a signed graph to have full rank
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs
- Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions
- On almost \(k\)-covers of hypercubes
- scientific article; zbMATH DE number 7283876 (Why is no real title available?)
- Neighbor sum distinguishing total choice number of planar graphs without 6-cycles
- An algebraic formulation of hypergraph colorings
- Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics
- Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
- Proof of the combinatorial nullstellensatz over integral domains, in the spirit of Kouba
- Local antimagic orientations of \(d\)-degenerate graphs
- Improper choosability and property B
- 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
- A note on edge weight choosability of graphs
- Punctured combinatorial Nullstellensätze
- On the neighbor sum distinguishing index of planar graphs
- Note on a zero net-regular signed graph
- List-coloring claw-free graphs with \(\Delta-1\) colors
- Directed cycles with zero weight in \(\mathbb{Z}_p^k\)
- The unit theorem for finite-dimensional algebras
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- A generalization of Schauz and Brink's restricted-variable version of Chevalley's theorem
- On-line list coloring of matroids
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
- Antimagic labelings of caterpillars
- 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
- Optimal strong parity edge-coloring of complete graphs
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
- Characterizing arithmetic read-once formulae
- The permanent rank of a matrix
- On two questions about circular choosability
- Graphs with large girth and chromatic number are hard for Nullstellensatz
- Graphs are \((1, \varDelta + 1)\)-choosable
- The minimum distance of parameterized codes on projective tori
- On weighted zero-sum sequences
- Partial matrices all of whose completions have the same spectrum
- Asymptotics of traces of paths in the Young and Schur graphs
- Combinatorial Nullstellensatz and DP-coloring of graphs
- Additive coloring of planar graphs
- Addition of sets via symmetric polynomials - a polynomial method
- Gröbner bases for increasing sequences
- Zero-sum problems and coverings by proper cosets
- On zeros of multilinear polynomials
- Neighbor sum distinguishing total choosability of cubic graphs
- A new class of antimagic Cartesian product graphs
- Neighbor sum distinguishing index of subcubic graphs
- A note on degree-constrained subgraphs
- Permutations over cyclic groups
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
- An inverse theorem for the restricted set addition in Abelian groups.
- Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields
- The polynomial method in the study of zero-sum theorems
- Value sets of polynomials and the Cauchy-Davenport theorem.
- Zero-sum subsets in vector spaces over finite fields
- Local antimagic orientation of graphs
- Neighbor sum distinguishing list total coloring of subcubic graphs
- Squarefree polynomials with prescribed coefficients
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- On the modular sumset partition problem
- On the existence of zero-sum subsequences of distinct lengths
- Transversals of additive Latin squares
- The Alon-Tarsi number of two kinds of planar graphs
- Lucky labelings of graphs
- Graph polynomials and group coloring of graphs
- Weighted-1-antimagic graphs of prime power order
- Neighbor sum distinguishing index of sparse graphs
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs
- scientific article; zbMATH DE number 7561716 (Why is no real title available?)
- The primes contain arbitrarily long polynomial progressions
- Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
- Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
- On the complexity of Hilbert refutations for partition
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- System of unbiased representatives for a collection of bicolorings
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
- Combinatorial Nullstellensatz
- On Snevily's conjecture and restricted sumsets.
- 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
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)
