A generalized Kneser conjecture
From MaRDI portal
Publication:750443
DOI10.1016/0095-8956(90)90029-YzbMath0714.05001MaRDI QIDQ750443
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items
Box complexes, neighborhood complexes, and the chromatic number, Random lifts of graphs: Independence and chromatic number, The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs, A combinatorial proof for the circular chromatic number of Kneser graphs, On the van Kampen-Flores theorem, On generalized Kneser hypergraph colorings, Hom complexes and hypergraph colorings, Colorings of complements of line graphs, Embedding dimensions of simplicial complexes on few vertices, On the chromatic number of Kneser hypergraphs, On the Chromatic Thresholds of Hypergraphs, Lower bounds for the chromatic number of certain Kneser-type 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, Homotopy types of box complexes, The genus of \(G\)-spaces and topological lower bounds for chromatic numbers of hypergraphs, Spaces of embeddings: Nonsingular bilinear maps, chirality, and their generalizations, Tverberg’s theorem is 50 years old: A survey, A Generalized van Kampen-Flores Theorem, Dold's theorem from viewpoint of strong compatibility graphs, The Tverberg-Vrećica problem and the combinatorial geometry on vector bundles, Unavoidable complexes, via an elementary equivariant index theory, Tucker-Ky Fan Colorings, Topological bounds on the dimension of orthogonal representations of graphs, WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
Cites Work
- Unnamed Item
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- Kneser colorings of polyhedra
- A short proof of Kneser's conjecture
- From graphs to ortholattices and equivariant maps
- Topological methods in combinatorial problems
- Simple proofs of some Borsuk-Ulam results
- The Chromatic Number of Kneser Hypergraphs
