
arXiv: 1302.4647
In this note we give an extended version of Combinatorial Nullstellensatz, with weaker assumption on nonvanishing monomial. We also present an application of our result in a situation where the original theorem does not seem to work.
Coloring of graphs and hypergraphs, Algebraic combinatorics, 05E99, 05A99, 05C15, FOS: Mathematics, Mathematics - Combinatorics, combinatorial nullstellensatz, Combinatorics (math.CO), Enumerative combinatorics, application
Coloring of graphs and hypergraphs, Algebraic combinatorics, 05E99, 05A99, 05C15, FOS: Mathematics, Mathematics - Combinatorics, combinatorial nullstellensatz, Combinatorics (math.CO), Enumerative combinatorics, application
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 18 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
