On the public citation graph
A Generalization of Combinatorial Nullstellensatz
0 signed · 39 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199607)22:3<253::aid-jgt6>3.0.co;2-lopenalex-snapshot
Decompositions and reductions of snarks
inferredcites →https://doi.org/10.1016/0095-8956(81)90030-7openalex-snapshot
Construction of class 2 graphs with maximum vertex degree 3
inferredcites →https://doi.org/10.1016/s0012-365x(97)00255-0openalex-snapshot
Classifications and characterizations of snarks
inferredcites →https://doi.org/10.1017/s0963548398003411openalex-snapshot
Combinatorial Nullstellensatz
inferredcites →https://doi.org/10.37236/247openalex-snapshot
A Duality Based Proof of the Combinatorial Nullstellensatz
inferredcites →https://doi.org/10.37236/734openalex-snapshot
Algebraically Solvable Problems: Describing Polynomials as Equivalent to Explicit Solutions
inferredcites →https://doi.org/10.4169/000298910x521689openalex-snapshot
A Short Proof of Combinatorial Nullstellensatz
inferredcites →https://doi.org/10.7151/dmgt.1081openalex-snapshot
Cyclically 5-edge connected non-bicritical critical snarks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22107openalex-snapshot
General Parity Result and Cycle‐Plus‐Triangles Graphs
inferred← citeshttps://doi.org/10.1007/s00493-015-3267-8openalex-snapshot
Warning’s Second Theorem with restricted variables
inferred← citeshttps://doi.org/10.1007/s10623-021-00859-7openalex-snapshot
Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz
inferred← citeshttps://doi.org/10.1007/s10958-019-04377-9openalex-snapshot
Asymptotics of Traces of Paths in the Young and Schur Graphs
inferred← citeshttps://doi.org/10.1007/s11856-024-2668-zopenalex-snapshot
Additive combinatorics using equivariant cohomology
inferred← citeshttps://doi.org/10.1007/s40879-016-0099-zopenalex-snapshot
Polynomial approach to explicit formulae for generalized binomial coefficients
inferred← citeshttps://doi.org/10.1016/j.aim.2014.09.028openalex-snapshot
A new approach to constant term identities and Selberg-type integrals
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114037openalex-snapshot
Combinatorial Nullstellensatz and Turán numbers of complete r-partite r-uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114417openalex-snapshot
Corrigendum to “Combinatorial Nullstellensatz and Turán numbers of complete r-partite r-uniform hypergraphs” [Discrete Math. 347 (2024) 114037]
inferred← citeshttps://doi.org/10.1016/j.disopt.2020.100582openalex-snapshot
Spectral aspects of symmetric matrix signings
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.08.007openalex-snapshot
Finite phylogenetic complexity of Zp and invariants for Z3
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103697openalex-snapshot
The Alon–Tarsi number of a toroidal grid
inferred← citeshttps://doi.org/10.1017/s0004972720001197openalex-snapshot
THE NUMBER OF ROOTS OF A POLYNOMIAL SYSTEM
inferred← citeshttps://doi.org/10.1017/s0963548322000232openalex-snapshot
Polynomials over structured grids
inferred← citeshttps://doi.org/10.1090/s0002-9939-2014-12041-7openalex-snapshot
A simple proof of the Zeilberger–Bressoud 𝑞-Dyson theorem
inferred← citeshttps://doi.org/10.1090/tran/6119openalex-snapshot
Constant term identities and Poincaré polynomials
inferred← citeshttps://doi.org/10.1137/15m1051774openalex-snapshot
List-Coloring Claw-Free Graphs with $\Delta-1$ Colors
inferred← citeshttps://doi.org/10.23638/dmtcs-20-2-19openalex-snapshot
Sigma Partitioning: Complexity and Random Graphs
inferred← citeshttps://doi.org/10.37236/4359openalex-snapshot
The Combinatorial Nullstellensätze Revisited
inferred← citeshttps://doi.org/10.37236/7087openalex-snapshot
Constant Terms of Near-Dyson Polynomials
inferred← citeshttps://doi.org/10.3929/ethz-b-000495133openalex-snapshot
Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz
inferred← citeshttps://doi.org/10.46298/dmtcs.2145openalex-snapshot
The inapproximability for the $(0,1)$-additive number
inferred← citeshttps://doi.org/10.48550/arxiv.1308.2983openalex-snapshot
How to Extend Karolyi and Nagy's BRILLIANT Proof of the Zeilberger-Bressoud q-Dyson Theorem in order to Evaluate ANY Coefficient of the q-Dyson Product
inferred← citeshttps://doi.org/10.48550/arxiv.1402.6920openalex-snapshot
Computational Aspects of the Combinatorial Nullstellensatz Method
inferred← citeshttps://doi.org/10.48550/arxiv.1404.7793openalex-snapshot
Warning's Second Theorem with Resricted Variables
inferred← citeshttps://doi.org/10.48550/arxiv.1501.00224openalex-snapshot
Coloring games and algebraic problems on matroids
inferred← citeshttps://doi.org/10.48550/arxiv.1512.01673openalex-snapshot
Restricted Product Sets under Unique Representability
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.