On the public citation graph

Generalized Kneser coloring theorems with combinatorial proofs

0 signed · 74 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/bf00969645openalex-snapshot
A certain combinatorial inequality
inferredcites →https://doi.org/10.1016/0040-9383(93)90019-ropenalex-snapshot
Higher bruhat orders and cyclic hyperplane arrangements
inferredcites →https://doi.org/10.1016/0095-8956(90)90029-yopenalex-snapshot
A generalized kneser conjecture
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/0097-3165(78)90023-7openalex-snapshot
A short proof of Kneser's conjecture
inferredcites →https://doi.org/10.1016/0097-3165(81)90027-3openalex-snapshot
A constructive proof of Tucker's combinatorial lemma
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.1112/jlms/49.1.25openalex-snapshot
Chessboard Complexes and Matching Complexes
inferredcites →https://doi.org/10.1201/9780429493911openalex-snapshot
Elements of Algebraic Topology
inferredcites →https://doi.org/10.2307/1969651openalex-snapshot
A Generalization of Tucker's Combinatorial Lemma with Topological Applications

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.21826openalex-snapshot
On the Multichromatic Number of s‐Stable Kneser Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22945openalex-snapshot
A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_10openalex-snapshot
Using Brouwer’s Fixed Point Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_11openalex-snapshot
Colinear Coloring on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_4openalex-snapshot
Short Proofs of the Kneser-Lovász Coloring Principle
inferred← citeshttps://doi.org/10.1007/s00037-022-00233-6openalex-snapshot
The Complexity of Finding Fair Independent Sets in Cycles
inferred← citeshttps://doi.org/10.1007/s00222-005-0466-8openalex-snapshot
Generalized Kneser coloring theorems with combinatorial proofs
inferred← citeshttps://doi.org/10.1007/s00454-011-9368-2openalex-snapshot
A Geometric Proof of the Colored Tverberg Theorem
inferred← citeshttps://doi.org/10.1007/s00454-017-9934-3openalex-snapshot
New Construction of Graphs with High Chromatic Number and Small Clique Number
inferred← citeshttps://doi.org/10.1007/s00493-004-0011-1openalex-snapshot
A Combinatorial Proof of Kneser’s Conjecture*
inferred← citeshttps://doi.org/10.1007/s00493-010-2446-xopenalex-snapshot
Oriented matroids and Ky Fan’s theorem
inferred← citeshttps://doi.org/10.1007/s10474-020-01080-zopenalex-snapshot
On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges
inferred← citeshttps://doi.org/10.1007/s10878-015-9897-3openalex-snapshot
A combinatorial proof for the circular chromatic number of Kneser graphs
inferred← citeshttps://doi.org/10.1007/s11856-020-1980-5openalex-snapshot
Fair splittings by independent sets in sparse graphs
inferred← citeshttps://doi.org/10.1016/j.aam.2017.04.001openalex-snapshot
The automorphism group of the s-stable Kneser graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.01.008openalex-snapshot
Simplotopal maps and necklace splitting
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112554openalex-snapshot
Growing balanced covering sets
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.07.010openalex-snapshot
Combinatorial Stokes formulae
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.025openalex-snapshot
Hypergraphs with many Kneser colorings
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.ejc.2018.09.002openalex-snapshot
The neighborhood complexes of almost s -stable Kneser graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.03.004openalex-snapshot
Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.04.006openalex-snapshot
Topological bounds on the dimension of orthogonal representations of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.05.003openalex-snapshot
On the chromatic number of generalized Kneser hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103064openalex-snapshot
Dold’s theorem from viewpoint of strong compatibility graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103664openalex-snapshot
Lower bounds for the chromatic number of certain Kneser-type hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103704openalex-snapshot
Homomorphism complexes, reconfiguration, and homotopy for directed graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.06.037openalex-snapshot
Polytopal complexes: maps, chain complexes and… necklaces
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.09.002openalex-snapshot
2-D Tucker is PPA complete
inferred← citeshttps://doi.org/10.1016/j.jcta.2005.08.002openalex-snapshot
The Borsuk–Ulam-property, Tucker-property and constructive proofs in combinatorics
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.02.003openalex-snapshot
On generalized Kneser hypergraph colorings
inferred← citeshttps://doi.org/10.1016/j.jcta.2007.04.003openalex-snapshot
A combinatorial proof of a theorem of Freund
inferred← citeshttps://doi.org/10.1016/j.jcta.2008.06.009openalex-snapshot
Combinatorial Stokes formulas via minimal resolutions
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.2011.02.010openalex-snapshot
The chromatic number of almost stable Kneser hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2011.04.009openalex-snapshot
The equivariant topology of stable 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.1016/j.jcta.2017.08.010openalex-snapshot
Chromatic number of random Kneser hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.05.010openalex-snapshot
On the chromatic number of general Kneser hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.08.004openalex-snapshot
On the generalized Erdős–Kneser conjecture: Proofs and reductions
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.09.014openalex-snapshot
On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs
inferred← citeshttps://doi.org/10.1016/j.topol.2010.02.020openalex-snapshot
A combinatorial analog of a theorem of F.J. Dyson
inferred← citeshttps://doi.org/10.1016/s0165-4896(02)00087-2openalex-snapshot
Consensus-halving via theorems of Borsuk-Ulam and Tucker
inferred← citeshttps://doi.org/10.1017/s0963548315000061openalex-snapshot
On the Chromatic Thresholds of Hypergraphs
inferred← citeshttps://doi.org/10.1017/s0963548319000178openalex-snapshot
On the Chromatic Number of Matching Kneser Graphs
inferred← citeshttps://doi.org/10.1090/pcms/013/06openalex-snapshot
Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes
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.1090/s0002-9939-08-09588-9openalex-snapshot
Stable Kneser hypergraphs and ideals in ℕ with the Nikodym property
inferred← citeshttps://doi.org/10.1090/s1079-6762-03-00112-4openalex-snapshot
Topological obstructions to graph colorings
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.1112/jlms.12406openalex-snapshot
Sparse Kneser graphs are Hamiltonian
inferred← citeshttps://doi.org/10.1145/3708511openalex-snapshot
The Chromatic Number of Kneser Hypergraphs via Consensus Division
inferred← citeshttps://doi.org/10.1287/moor.1080.0311openalex-snapshot
Discrete Splittings of the Necklace
inferred← citeshttps://doi.org/10.1365/s13291-022-00247-7openalex-snapshot
Graph Theory – A Survey on the Occasion of the Abel Prize for László Lovász
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.37236/3971openalex-snapshot
Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem
inferred← citeshttps://doi.org/10.4007/annals.2007.165.965openalex-snapshot
Proof of the Lovász conjecture
inferred← citeshttps://doi.org/10.4213/rm9244openalex-snapshot
Топологические методы в комбинаторной геометрии
inferred← citeshttps://doi.org/10.47833/2021.3.csc.006openalex-snapshot
A study of the neighborhood complex of $-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.