The Chromatic Number of Kneser Hypergraphs
From MaRDI portal
Publication:3743337
DOI10.2307/2000624zbMath0605.05033MaRDI QIDQ3743337
Peter Frankl, Noga Alon, László Lovász
Publication date: 1986
Full work available at URL: https://doi.org/10.2307/2000624
Related Items
On the chromatic number of Kneser hypergraphs, Unnamed Item, A generalized Kneser conjecture, On generalized Kneser hypergraph colorings, Combinatorial Stokes formulas via minimal resolutions, Extremal problems concerning Kneser-graphs, Splitting necklaces, On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings, Box complexes, neighborhood complexes, and the chromatic number, Complexes of graph homomorphisms, Colorful subgraphs in Kneser-like graphs, WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences, Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property, Local chromatic number and distinguishing the strength of topological obstructions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Supersaturated graphs and hypergraphs
- Extremal problems concerning Kneser-graphs
- Splitting necklaces
- Homotopy properties of greedoids
- Hypergraphs do not jump
- A short proof of Kneser's conjecture
- A generalization of the Erdős-Ko-Rado theorem on finite set systems
- Bisection of Circle Colorings
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- On the chromatic number of the general Kneser-graph
- On a Topological Generalization of a Theorem of Tverberg
- The Ramsey number for stripes
- On complete subgraphs of different orders
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- On the imbedding of systems of compacta in simplicial complexes
- On the theory of graphs
- On intersecting families of finite sets
