The Chromatic Number of Kneser Hypergraphs
From MaRDI portal
Publication:3743337
DOI10.2307/2000624zbMath0605.05033OpenAlexW4232811605MaRDI QIDQ3743337
Peter Frankl, Noga Alon, László Lovász
Publication date: 1986
Full work available at URL: https://doi.org/10.2307/2000624
Hypergraphs (05C65) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15)
Related Items (60)
On random subgraphs of Kneser and Schrijver graphs ⋮ Box complexes, neighborhood complexes, and the chromatic number ⋮ Splitting necklaces ⋮ Complexes of graph homomorphisms ⋮ A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ On generalized Kneser hypergraph colorings ⋮ Choice number of Kneser graphs ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ Vertex covering with monochromatic pieces of few colours ⋮ Chromatic number of random Kneser hypergraphs ⋮ Fair splittings by independent sets in sparse graphs ⋮ Hom complexes and hypergraph colorings ⋮ Transversals to the convex hulls of all \(k\)-sets of discrete subsets of \(\mathbb R^n\) ⋮ A counterexample to a conjecture on the chromatic number of r $r$‐stable Kneser hypergraphs ⋮ Colorful subhypergraphs in Kneser hypergraphs ⋮ Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs ⋮ Hedetniemi's conjecture from the topological viewpoint ⋮ On graphs with prescribed subgraphs of order $k$, and a theorem of Kelly and Merriell ⋮ On the number of star‐shaped classes in optimal colorings of Kneser graphs ⋮ Homotopy and Hom construction in the category of finite hypergraphs ⋮ Large monochromatic components in 3‐edge‐colored Steiner triple systems ⋮ On the chromatic number of Kneser hypergraphs ⋮ Monochromatic spanning trees and matchings in ordered complete graphs ⋮ On the Chromatic Thresholds of Hypergraphs ⋮ Multicolor Ramsey numbers for triple systems ⋮ Lower bounds for the chromatic number of certain Kneser-type hypergraphs ⋮ Homomorphism complexes, reconfiguration, and homotopy for directed graphs ⋮ Coloring properties of categorical product of general Kneser hypergraphs ⋮ Intersection patterns of finite sets and of convex sets ⋮ On the generalized Erdős-Kneser conjecture: proofs and reductions ⋮ On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Random Kneser graphs and hypergraphs ⋮ Colorful subgraphs in Kneser-like graphs ⋮ Colorful subhypergraphs in uniform hypergraphs ⋮ On multicolor Ramsey numbers for loose \(k\)-paths of length three ⋮ Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles ⋮ A new lower bound for the chromatic number of general Kneser hypergraphs ⋮ Hedetniemi's conjecture for Kneser hypergraphs ⋮ On characterizing the critical graphs for matching Ramsey numbers ⋮ On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings ⋮ The chromatic number of almost stable Kneser hypergraphs ⋮ Chromatic number via Turán number ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property ⋮ On the chromatic number of generalized Kneser graphs and Hadamard matrices ⋮ Local chromatic number and distinguishing the strength of topological obstructions ⋮ Ramsey numbers for partially-ordered sets ⋮ A note on homomorphisms of Kneser hypergraphs ⋮ Chromatic Ramsey number of acyclic hypergraphs ⋮ Combinatorial Stokes formulas via minimal resolutions ⋮ A generalized Kneser conjecture ⋮ Matchings with few colors in colored complete graphs and hypergraphs ⋮ On the Chromatic Number of Matching Kneser Graphs ⋮ Large disjoint subgraphs with the same order and size ⋮ Clique chromatic numbers of intersection graphs ⋮ On the chromatic number of generalized Kneser hypergraphs ⋮ WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences ⋮ Extremal problems concerning Kneser-graphs ⋮ On the Multichromatic Number of s‐Stable Kneser Graphs
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
This page was built for publication: The Chromatic Number of Kneser Hypergraphs
