On the public citation graph
Colorful Subhypergraphs in Kneser Hypergraphs
0 signed · 38 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/jgt.20079openalex-snapshot
A topological lower bound for the circular chromatic number of Schrijver graphs
inferredcites →https://doi.org/10.1007/bf00969645openalex-snapshot
A certain combinatorial inequality
inferredcites →https://doi.org/10.1007/s00222-005-0466-8openalex-snapshot
Generalized Kneser coloring theorems with combinatorial proofs
inferredcites →https://doi.org/10.1007/s002220100188openalex-snapshot
Generalized Kneser coloring theorems with combinatorial proofs
inferredcites →https://doi.org/10.1007/s00493-004-0011-1openalex-snapshot
A Combinatorial Proof of Kneser’s Conjecture*
inferredcites →https://doi.org/10.1007/s00493-006-0034-xopenalex-snapshot
Local Chromatic Number, KY Fan's Theorem, And Circular Colorings
inferredcites →https://doi.org/10.1016/0012-365x(86)90065-8openalex-snapshot
Coloring graphs with locally few colors
inferredcites →https://doi.org/10.1016/0095-8956(76)90010-1openalex-snapshot
n-Tuple colorings and associated graphs
inferredcites →https://doi.org/10.1016/0097-3165(78)90022-5openalex-snapshot
Kneser's conjecture, chromatic number, and homotopy
inferredcites →https://doi.org/10.1016/b978-0-08-016160-0.50028-2openalex-snapshot
ELEMENTS OF ALGEBRAIC TOPOLOGY
inferredcites →https://doi.org/10.1016/j.disc.2005.10.001openalex-snapshot
On the diameter of Kneser graphs
inferredcites →https://doi.org/10.1016/j.ejc.2007.04.015openalex-snapshot
Colorful subgraphs in Kneser-like graphs
inferredcites →https://doi.org/10.1016/j.jcta.2008.06.009openalex-snapshot
Combinatorial Stokes formulas via minimal resolutions
inferredcites →https://doi.org/10.1016/j.jcta.2011.02.010openalex-snapshot
The chromatic number of almost stable Kneser hypergraphs
inferredcites →https://doi.org/10.1016/j.jctb.2015.05.010openalex-snapshot
On the chromatic number of general Kneser hypergraphs
inferredcites →https://doi.org/10.1090/pspum/019/0432462openalex-snapshot
Problems and results in combinatorial analysis
inferredcites →https://doi.org/10.1090/s0002-9939-02-06371-2openalex-snapshot
On the chromatic number of Kneser hypergraphs
inferredcites →https://doi.org/10.1090/s0002-9947-1986-0857448-8openalex-snapshot
The Chromatic Number of Kneser Hypergraphs
inferredcites →https://doi.org/10.1090/s0002-9947-1992-1081939-3openalex-snapshot
Equivariant Cohomology and Lower Bounds for Chromatic Numbers
inferredcites →https://doi.org/10.1090/s0002-9947-99-02494-0openalex-snapshot
A correction to “Equivariant cohomology and lower bounds for chromatic numbers”
inferredcites →https://doi.org/10.2307/1969651openalex-snapshot
A Generalization of Tucker's Combinatorial Lemma with Topological Applications
inferredcites →https://doi.org/10.48550/arxiv.math/0208072openalex-snapshot
Topological lower bounds for the chromatic number: A hierarchy
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11590-020-01669-xopenalex-snapshot
Edge metric dimensions via hierarchical product and integer linear programming
inferred← citeshttps://doi.org/10.1016/j.disc.2017.05.010openalex-snapshot
Chromatic number via Turán number
inferred← citeshttps://doi.org/10.1016/j.disc.2018.02.007openalex-snapshot
Altermatic number of categorical product of graphs
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.2018.03.007openalex-snapshot
A new lower bound for the chromatic number of general Kneser hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2016.05.002openalex-snapshot
Hedetniemi's conjecture for Kneser hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.02.007openalex-snapshot
On chromatic number and minimum cut
inferred← citeshttps://doi.org/10.1109/isit.2019.8849620openalex-snapshot
Network Coding Solutions for the Combination Network and its Subgraphs
inferred← citeshttps://doi.org/10.1109/tit.2020.2995845openalex-snapshot
Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
inferred← citeshttps://doi.org/10.37236/6154openalex-snapshot
Colorful Subhypergraphs in Uniform Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3021openalex-snapshot
Hedetniemi's conjecture for Kneser hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1510.06932openalex-snapshot
A Note on Altermatic Number
inferred← citeshttps://doi.org/10.48550/arxiv.1711.06621openalex-snapshot
On the chromatic number of almost s-stable Kneser graphs
inferred← citeshttps://doi.org/10.52547/mmr.6.1.39openalex-snapshot
On the Altermatic Number of 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.