On the public citation graph

A certain combinatorial inequality

0 signed · 22 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1016/0097-3165(78)90022-5openalex-snapshot
Kneser's conjecture, chromatic number, and homotopy
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

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.22689openalex-snapshot
Colorings of complements of line graphs
inferred← citeshttps://doi.org/10.1002/jgt.23032openalex-snapshot
On the number of star‐shaped classes in optimal colorings of Kneser graphs
inferred← citeshttps://doi.org/10.1007/s00222-005-0466-8openalex-snapshot
Generalized Kneser coloring theorems with combinatorial proofs
inferred← citeshttps://doi.org/10.1007/s002220100188openalex-snapshot
Generalized Kneser coloring theorems with combinatorial proofs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114422openalex-snapshot
Box complexes: At the crossroad of graph theory and topology
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.03.011openalex-snapshot
Strengthening topological colorful results for graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104033openalex-snapshot
Hadwiger’s conjecture and topological bounds
inferred← citeshttps://doi.org/10.1016/j.jcta.2010.08.008openalex-snapshot
A new coloring theorem of Kneser graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2016.05.002openalex-snapshot
Hedetniemi's conjecture for Kneser hypergraphs
inferred← citeshttps://doi.org/10.1090/bull/1634openalex-snapshot
Tverberg’s theorem is 50 years old: A survey
inferred← citeshttps://doi.org/10.1090/proc/13443openalex-snapshot
Intersection patterns of finite sets and of convex sets
inferred← citeshttps://doi.org/10.1090/s0002-9939-02-06371-2openalex-snapshot
On the chromatic number of Kneser hypergraphs
inferred← citeshttps://doi.org/10.1093/imrn/rny135openalex-snapshot
Chromatic Numbers of Stable Kneser Hypergraphs via Topological Tverberg-Type Theorems
inferred← citeshttps://doi.org/10.1137/19m1295921openalex-snapshot
Topological Bounds for Graph Representations over Any Field
inferred← citeshttps://doi.org/10.26493/1855-3974.1296.5c7openalex-snapshot
Circular chromatic number of induced subgraphs of Kneser graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.1414.58bopenalex-snapshot
Coloring properties of categorical product of general Kneser hypergraphs
inferred← citeshttps://doi.org/10.37236/3573openalex-snapshot
Colorful Subhypergraphs in Kneser Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3021openalex-snapshot
Hedetniemi's conjecture for Kneser hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1711.06621openalex-snapshot
On the chromatic number of almost s-stable Kneser graphs
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.